Finding Total and Partial Orders from Data for Seriation

Authors:
Heikki Mannila
Affiliations:
HIIT, Helsinki University of Technology and University of Helsinki, Finland
Venue:
DS '08 Proceedings of the 11th International Conference on Discovery Science
Year:
2008

Citing 27
Cited 0

Generating functionology

Generating functionology
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
A Spectral Algorithm for Seriation and the Consecutive Ones Problem

SIAM Journal on Computing
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Global partial orders from sequential data

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Spectral analysis of data

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Topic-sensitive PageRank

Proceedings of the 11th international conference on World Wide Web
A simple test for the consecutive ones property

Journal of Algorithms
Comparing top k lists

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Cranking: Combining Rankings Using Conditional Probability Models on Permutations

ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
Efficient similarity search and classification via rank aggregation

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Fragments of order

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Rank-aware query optimization

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Link analysis ranking: algorithms, theory, and experiments

ACM Transactions on Internet Technology (TOIT)
Comparing and aggregating rankings with ties

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
RankSQL: query algebra and optimization for relational top-k queries

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Finding partial orders from unordered 0-1 data

Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Ordering by weighted number of wins gives a good ranking for weighted tournaments

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Algorithms for discovering bucket orders from data

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Deterministic pivoting algorithms for constrained ranking and clustering problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic ranking of database query results

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Finding Outlying Items in Sets of Partial Rankings

PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Learning to order things

Journal of Artificial Intelligence Research
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.