A Local-Search 2-Approximation for 2-Correlation-Clustering

Authors:
Tom Coleman;James Saunderson;Anthony Wirth
Affiliations:
The University of Melbourne,;The University of Melbourne,;The University of Melbourne,
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 10
Cited 3

A Coding Approach to Signed Graphs

SIAM Journal on Discrete Mathematics
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Local Search Heuristics for k-Median and Facility Location Problems

SIAM Journal on Computing
Correlation Clustering

Machine Learning
Cluster graph modification problems

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Correlation clustering with a fixed number of clusters

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Clustering with qualitative information

Journal of Computer and System Sciences - Special issue: Learning theory 2003
Spectral clustering with inconsistent advice

Proceedings of the 25th international conference on Machine learning
Optimal edge deletions for signed graph balancing

WEA'07 Proceedings of the 6th international conference on Experimental algorithms

Ranking tournaments: Local search and a new algorithm

Journal of Experimental Algorithmics (JEA)
Separator-based data reduction for signed graph balancing

Journal of Combinatorial Optimization
A polynomial time approximation scheme for k-consensus clustering

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

CorrelationClusteringis now an established problem in the algorithms and constrained clustering communities. With the requirement that at most two clusters be formed, the minimisation problem is related to the study of signed graphsin the social psychology community, and has applications in statistical mechanics and biological networks.Although a PTAS exists for this problem, its running time is impractical. We therefore introduce a number of new algorithms for 2CC, including two that incorporate some notion of local search. In particular, we show that the algorithm we call PASTA-tossis a 2-approximation on complete graphs.Experiments confirm the strong performance of the local search approaches, even on non-complete graphs, with running time significantly lower than rival approaches.