Skip to main content
Springer Nature Link
Log in

Simple Iterative Heuristics for Correlation Clustering

  • Conference paper
  • First Online:
Large-Scale Scientific Computing (LSSC 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8353))

Included in the following conference series:

Abstract

A straightforward natural iterative heuristic for correlation clustering in the general setting is to start from singleton clusters and whenever merging two clusters improves the current quality score merge them into a single cluster. We analyze the approximation and complexity aspects of this heuristic and its randomized variant where two clusters to merge are chosen uniformly at random among cluster pairs amenable to merge.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 684–693 (2005)

    Google Scholar 

  2. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1–3), 89–113 (2004)

    Article  MATH  Google Scholar 

  3. Becker, H.: A survey of correlation clustering. In: COMS E6998: Advanced Topics in Computational Learning Theory, pp. 1–10 (2005)

    Google Scholar 

  4. Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science (FOCS 2003), pp. 524–533 (2003)

    Google Scholar 

  5. Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 1–13. Springer, Heidelberg (2003)

    Google Scholar 

  6. Emanuel, D., Fiat, A.: Correlation clustering – minimizing disagreements on arbitrary weighted graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 208–220. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Kearns, M.J., Shapire, R.E., Sellie, L.M.: Toward efficient agnostic learning. Mach. Learn. 17(2/3), 115–142 (1994)

    Article  MATH  Google Scholar 

  8. Swamy, C.: Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 526–527 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Lund, Sweden

    Andrzej Lingas

  2. Department of Computer Science, Malmö University, Malmö, Sweden

    Mia Persson

Authors
  1. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mia Persson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Lingas .

Editor information

Editors and Affiliations

  1. Inst. of Info. & Comm. Technologies, Bulgarian Academy of Sciences, Sofia, Bulgaria

    Ivan Lirkov

  2. Bulgarian Academy of Sciences, Sofia, Bulgaria

    Svetozar Margenov

  3. Dept. of Informatics and Mathematical Modell, Technical University of Denmark, Kongens Lyngby, Denmark

    Jerzy Waśniewski

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lingas, A., Persson, M. (2014). Simple Iterative Heuristics for Correlation Clustering. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2013. Lecture Notes in Computer Science(), vol 8353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43880-0_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-43880-0_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-43879-4

  • Online ISBN: 978-3-662-43880-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics