Aggregating inconsistent information: Ranking and clustering

Authors:
Nir Ailon;Moses Charikar;Alantha Newman
Affiliations:
Google Research, New York, NY;Princeton University, Princeton, NJ;DIMACS, Rutgers University, New Brunswick, NJ
Venue:
Journal of the ACM (JACM)
Year:
2008

Citing 22
Cited 48

On feedback problems in digraphs

WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
A polynomial algorithm for the 2-path problem for semicomplete digraphs

SIAM Journal on Discrete Mathematics
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Some optimal inapproximability results

Journal of the ACM (JACM)
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
Efficient similarity search and classification via rank aggregation

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clustering with Qualitative Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Integrating Microarray Data by Consensus Clustering

ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Correlation Clustering

Machine Learning
Clustering Aggregation

ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fitting tree metrics: Hierarchical clustering and Phylogeny

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On the tandem duplication-random loss model of genome rearrangement

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Ranking Tournaments

SIAM Journal on Discrete Mathematics
How to rank with few errors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Aggregation of Partial Rankings, p-Ratings and Top-m Lists

Algorithmica
Robust reductions from ranking to classification

COLT'07 Proceedings of the 20th annual conference on Learning theory
Deterministic algorithms for rank aggregation and other ranking and clustering problems

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms

How similarity helps to efficiently compute Kemeny rankings

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Consensus answers for queries over probabilistic databases

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Mathematics of Operations Research
Bounding and comparing methods for correlation clustering beyond ILP

ILP '09 Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing
Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science
Rigorous Probabilistic Trust-Inference with Applications to Clustering

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Clustering with partial information

Theoretical Computer Science
Content modeling using latent permutations

Journal of Artificial Intelligence Research
Generalized distances between rankings

Proceedings of the 19th international conference on World wide web
A polynomial time approximation scheme for k-consensus clustering

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Clustering with diversity

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Controlled Perturbation of sets of line segments in R2 with smart processing order

Computational Geometry: Theory and Applications
Online ranking for tournament graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Average parameterization and partial kernelization for computing medians

Journal of Computer and System Sciences
Unified analysis of streaming news

Proceedings of the 20th international conference on World wide web
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments

Theoretical Computer Science
Ranking and drawing in subexponential time

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Automatic discovery of attributes in relational databases

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Homogeneity and monotonicity of distance-rationalizable voting rules

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Approximation schemes for the betweenness problem in tournaments and related ranking problems

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
The minimum transfer cost principle for model-order selection

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Improved approximation algorithms for bipartite correlation clustering

ESA'11 Proceedings of the 19th European conference on Algorithms
Using Kendall-τ meta-bagging to improve protein-protein docking predictions

PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny

SIAM Journal on Computing
Average parameterization and partial kernelization for computing medians

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Kernel and fast algorithm for dense triplet inconsistency

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters

Theoretical Computer Science
An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity

The Journal of Machine Learning Research
So who won?: dynamic max discovery with the crowd

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On the approximability of Dodgson and Young elections

Artificial Intelligence
The feedback arc set problem with triangle inequality is a vertex cover problem

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Visualization of Global Correlation Structures in Uncertain 2D Scalar Fields

Computer Graphics Forum
Chromatic correlation clustering

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Routing state distance: a path-based metric for network analysis

Proceedings of the 2012 ACM conference on Internet measurement conference
A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Clustering with local restrictions

Information and Computation
Sorting noisy data with partial information

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Rank quantization

Proceedings of the sixth ACM international conference on Web search and data mining
Kernel and fast algorithm for dense triplet inconsistency

Theoretical Computer Science
The Impacts of Structural Difference and Temporality of Tweets on Retrieval Effectiveness

ACM Transactions on Information Systems (TOIS)
Parameterized enumeration of (locally-) optimal aggregations

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
WOO: a scalable and multi-tenant platform for continuous knowledge base synthesis

Proceedings of the VLDB Endowment
Multistage approach for clustering and classification of ECG data

Computer Methods and Programs in Biomedicine
Kemeny elections with bounded single-peaked or single-crossing width

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fully proportional representation as resource allocation: approximability results

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A statistical view of clustering performance through the theory of U-processes

Journal of Multivariate Analysis

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address optimization problems in which we are given contradictory pieces of input information and the goal is to find a globally consistent solution that minimizes the extent of disagreement with the respective inputs. Specifically, the problems we address are rank aggregation, the feedback arc set problem on tournaments, and correlation and consensus clustering. We show that for all these problems (and various weighted versions of them), we can obtain improved approximation factors using essentially the same remarkably simple algorithm. Additionally, we almost settle a long-standing conjecture of Bang-Jensen and Thomassen and show that unless NP⊆BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.