NP-hard problems in hierarchical-tree clustering
Acta Informatica
Clustering hypertext with applications to web searching
HYPERTEXT '00 Proceedings of the eleventh ACM on Hypertext and hypermedia
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Feature Weighting in k-Means Clustering
Machine Learning
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
Machine Learning
Fitting tree metrics: Hierarchical clustering and Phylogeny
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
SIAM Journal on Discrete Mathematics
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
Combinatorics, Probability and Computing
ACM Transactions on Knowledge Discovery from Data (TKDD)
SIAM Journal on Discrete Mathematics
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deterministic pivoting algorithms for constrained ranking and clustering problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregation of partial rankings, p-ratings and top-m lists
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Deterministic algorithms for rank aggregation and other ranking and clustering problems
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Approximating the best-fit tree under Lp norms
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Theoretical Computer Science
The nearest neighbor spearman footrule distance for bucket, interval, and partial orders
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Improved approximation algorithms for bipartite correlation clustering
ESA'11 Proceedings of the 19th European conference on Algorithms
A More Relaxed Model for Graph-Based Data Clustering: $s$-Plex Cluster Editing
SIAM Journal on Discrete Mathematics
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
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Fixed-parameter complexity of feedback vertex set in bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
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
Parameterized enumeration of (locally-) optimal aggregations
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We consider ranking and clustering problems related to the aggregation of inconsistent information, in particular, rank aggregation, (weighted) feedback arc set in tournaments, consensus and correlation clustering, and hierarchical clustering. Ailon et al. [Ailon, N., M. Charikar, A. Newman. 2005. Aggregating inconsistent information: Ranking and clustering. Proc. 37th Annual ACM Sympos. Theory Comput. (STOC '05), 684--693], Ailon and Charikar [Ailon, N., M. Charikar. 2005. Fitting tree metrics: Hierarchical clustering and phylogeny. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS '05), 73--82], and Ailon [Ailon, N. 2007. Aggregation of partial rankings, p-ratings and top-m lists. Proc. 18th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA '07), 415--424] proposed randomized constant factor approximation algorithms for these problems, which recursively generate a solution by choosing a random vertex as “pivot” and dividing the remaining vertices into two groups based on the pivot vertex. In this paper, we answer an open question in these works by giving deterministic approximation algorithms for these problems. The analysis of our algorithms is simpler than the analysis of the randomized algorithms. In addition, we consider the problem of finding minimum-cost rankings and clusterings that must obey certain constraints (e.g., an input partial order in the case of ranking problems), which were introduced by Hegde and Jain [Hegde, R., K. Jain. 2006. Personal communication]. We show that the first type of algorithms we propose can also handle these constrained problems. In addition, we show that in the case of a rank aggregation or consensus clustering problem, if the input rankings or clusterings obey the constraints, then we can always ensure that the output of any algorithm obeys the constraints without increasing the objective value of the solution.