Finding Total and Partial Orders from Data for Seriation
Abstract
Ordering and ranking items of different types (observations, web pages, etc.) are important tasks in various applications, such as query processing and scientific data mining. We consider different problems of inferring total or partial orders from data, with special emphasis on applications to the seriation problem in paleontology. Seriation can be viewed as the task of ordering rows of a 0-1 matrix so that certain conditions hold. We review different approaches to this task, including spectral ordering methods, techniques for finding partial orders, and probabilistic models using MCMC methods. Joint work with Antti Ukkonen, Aris Gionis, Mikael Fortelius, Kai Puolamäki, and Jukka Jernvall.
Cite
Text
Mannila. "Finding Total and Partial Orders from Data for Seriation." International Conference on Algorithmic Learning Theory, 2008. doi:10.1007/978-3-540-87987-9_4Markdown
[Mannila. "Finding Total and Partial Orders from Data for Seriation." International Conference on Algorithmic Learning Theory, 2008.](https://mlanthology.org/alt/2008/mannila2008alt-finding/) doi:10.1007/978-3-540-87987-9_4BibTeX
@inproceedings{mannila2008alt-finding,
title = {{Finding Total and Partial Orders from Data for Seriation}},
author = {Mannila, Heikki},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2008},
pages = {4},
doi = {10.1007/978-3-540-87987-9_4},
url = {https://mlanthology.org/alt/2008/mannila2008alt-finding/}
}