Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT

by   Vaggos Chatziafratis, et al.
Stanford University

In this paper, we study a number of well-known combinatorial optimization problems that fit in the following paradigm: the input is a collection of (potentially inconsistent) local relationships between the elements of a ground set (e.g., pairwise comparisons, similar/dissimilar pairs, or ancestry structure of triples of points), and the goal is to aggregate this information into a global structure (e.g., a ranking, a clustering, or a hierarchical clustering) in a way that maximizes agreement with the input. Well-studied problems such as rank aggregation, correlation clustering, and hierarchical clustering with triplet constraints fall in this class of problems. We study these problems on stochastic instances with a hidden embedded ground truth solution. Our main algorithmic contribution is a unified technique that uses the maximum cut problem in graphs to approximately solve these problems. Using this technique, we can often get approximation guarantees in the stochastic setting that are better than the known worst case inapproximability bounds for the corresponding problem. On the negative side, we improve the worst case inapproximability bound on several hierarchical clustering formulations through a reduction to related ranking problems.


page 1

page 2

page 3

page 4


Shortest path queries, graph partitioning and covering problems in worst and beyond worst case settings

In this thesis, we design algorithms for several NP-hard problems in bot...

Min-Max Correlation Clustering via MultiCut

Correlation clustering is a fundamental combinatorial optimization probl...

Inapproximability for Local Correlation Clustering and Dissimilarity Hierarchical Clustering

We present hardness of approximation results for Correlation Clustering ...

A Revenue Function for Comparison-Based Hierarchical Clustering

Comparison-based learning addresses the problem of learning when, instea...

Modern hierarchical, agglomerative clustering algorithms

This paper presents algorithms for hierarchical, agglomerative clusterin...

Smoothed Efficient Algorithms and Reductions for Network Coordination Games

Worst-case hardness results for most equilibrium computation problems ha...

p-Norm Flow Diffusion for Local Graph Clustering

Local graph clustering and the closely related seed set expansion proble...

Please sign up or login with your details

Forgot password? Click here to reset