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

  • Tom Coleman
  • James Saunderson
  • Anthony Wirth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5193)

Abstract

CorrelationClustering is 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 graphs in 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-toss is 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning 56(1), 89–113 (2004)MATHCrossRefGoogle Scholar
  2. 2.
    Harary, F.: On the notion of balance of a signed graph. Michigan Mathematical Journal 2, 143–146 (1953)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Solé, P., Zaslavsky, T.: A coding approach to signed graphs. SIAM Journal on Discrete Mathematics 7, 544–553 (1994)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discrete Applied Mathematics 144(1-2), 173–182 (2004)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1167–1176 (2006)Google Scholar
  6. 6.
    Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. Journal of Computer and System Sciences 71(3), 360–383 (2005)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. In: Proceedings of the 37th annual ACM Symposium on Theory of Computing, pp. 684–693 (2005)Google Scholar
  8. 8.
    Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42(6), 1115–1145 (1995)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    DasGupta, B., Enciso, G., Sontag, E., Zhang, Y.: Algorithmic and complexity results for decompositions of biological networks into monotone subsystems. BioSystems 90(1), 161–178 (2007)CrossRefGoogle Scholar
  10. 10.
    Huffner, F., Betzler, N., Niedermeier, R.: Optimal edge deletions for signed graph balancing. In: Proceedings of the 6th Workshop on Experimental Algorithms, pp. 297–310 (2007)Google Scholar
  11. 11.
    Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. SIAM Journal on Computing 33(3), 544–562Google Scholar
  12. 12.
    Coleman, T., Saunderson, J., Wirth, A.: Spectral clustering with inconsistent advice. In: Proceedings of the 25th Annual International Conference on Machine Learning, pp. 152–159 (2008)Google Scholar
  13. 13.
    Zaslavsky, T.: Signed Graphs. Discrete Applied Mathematics 4, 47–74 (1982)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Tom Coleman
    • 1
  • James Saunderson
    • 1
  • Anthony Wirth
    • 1
  1. 1.The University of Melbourne 

Personalised recommendations