Papers
Topics
Authors
Recent
Search
2000 character limit reached

Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering

Published 29 Sep 2023 in cs.DS | (2309.17243v1)

Abstract: We consider the classic Correlation Clustering problem: Given a complete graph where edges are labelled either $+$ or $-$, the goal is to find a partition of the vertices that minimizes the number of the \pedges across parts plus the number of the \medges within parts. Recently, Cohen-Addad, Lee and Newman [CLN22] presented a 1.994-approximation algorithm for the problem using the Sherali-Adams hierarchy, hence breaking through the integrality gap of 2 for the classic linear program and improving upon the 2.06-approximation of Chawla, Makarychev, Schramm and Yaroslavtsev [CMSY15]. We significantly improve the state-of-the-art by providing a 1.73-approximation for the problem. Our approach introduces a preclustering of Correlation Clustering instances that allows us to essentially ignore the error arising from the {\em correlated rounding} used by [CLN22]. This additional power simplifies the previous algorithm and analysis. More importantly, it enables a new {\em set-based rounding} that complements the previous roundings. A combination of these two rounding algorithms yields the improved bound.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. Correlation clustering in data streams. In Proceedings of the 32nd International Conference on Machine Learning (ICML), pages 2237–2246, 2015.
  2. Aggregating inconsistent information: Ranking and clustering. Journal of the ACM, 55(5):1–27, 2008.
  3. Generating labels from clicks. In Proceedings of the Second ACM International Conference on Web Search and Data Mining, pages 172–181, 2009.
  4. Large-scale deduplication with constraints using dedupalog. In Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE), pages 952–963, 2009.
  5. Sublinear time and space algorithms for correlation clustering via sparse-dense decompositions. In Proceedings of the 13th Conference on Innovations in Theoretical Computer Science (ITCS), volume 215 of LIPIcs, pages 10:1–10:20, 2022.
  6. Correlation clustering. Machine learning, 56(1):89–113, 2004.
  7. Almost 3-approximate correlation clustering in constant rounds. In Proceedings of 63rd Annual IEEE Symposium on Foundations of Computer Science, (FOCS), pages 720–731, 2022.
  8. Single-pass streaming algorithms for correlation clustering. In Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 819–849, 2023.
  9. Differentially private correlation clustering. In International Conference on Machine Learning (ICML), pages 1136–1146, 2021.
  10. Overlapping correlation clustering. Knowledge and Information Systems, 35(1):1–32, 2013.
  11. Massively parallel correlation clustering in bounded arboricity graphs. In 35th International Symposium on Distributed Computing (DISC), volume 209 of LIPIcs, pages 15:1–15:18, 2021.
  12. Correlation clustering in Mapreduce. In Proceedings of the 20th ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD), pages 641–650, 2014.
  13. Fitting distances by tree metrics minimizing the total error within a constant factor. In Proceedings of 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 468–479, 2021.
  14. Near-optimal correlation clustering with privacy. In Advances in Neural Information Processing Systems (Neurips), 2022.
  15. Fitting metrics and ultrametrics with minimum disagreements. In Proceedings of 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 301–311, 2022.
  16. Clustering with qualitative information. Journal of Computer and System Sciences, 71(3):360–383, 2005.
  17. On the hardness of approximating multicut and sparsest-cut. Computational Complexity, 15(2):94–114, 2006.
  18. A graph-theoretic approach to webpage segmentation. In Proceedings of the 17th International conference on World Wide Web (WWW), pages 377–386, 2008.
  19. Correlation clustering in constant many parallel rounds. In Proceedings of the 38th International Conference on Machine Learning (ICML), pages 2069–2078, 2021.
  20. Online and consistent correlation clustering. In Proceedings of International Conference on Machine Learning (ICML), pages 4157–4179, 2022.
  21. Correlation clustering with Sherali-Adams. In Proceedings of 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 651–661, 2022.
  22. Near optimal LP rounding algorithm for correlation clustering on complete and complete k𝑘kitalic_k-partite graphs. In Proceedings of the 47th annual ACM Symposium on Theory of Computing (STOC), pages 219–228, 2015.
  23. Clustering sparse graphs. In Advances in Neural Information Processing Systems (Neurips), pages 2204–2212, 2012.
  24. Correlation clustering in general weighted graphs. Theoretical Computer Science, 361(2-3):172–187, 2006.
  25. Wenceslas Fernandez de la Vega and Claire Kenyon-Mathieu. Linear programming relaxations of maxcut. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 53–61, 2007.
  26. Correlation clustering with a fixed number of clusters. Theory of Computing, 2:249–266, 2006.
  27. Geometric Algorithms and Combinatorial Optimization. Springer Science & Business Media, 2012.
  28. Web people search via connection analysis. IEEE Transactions on Knowledge and Data Engineering, 20(11):1550–1565, 2008.
  29. Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems. In Proceedings of the forty-first annual ACM symposium on Theory of computing (STOC), pages 313–322, 2009.
  30. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM, 49(5):616–639, 2002.
  31. Daogao Liu. Better private algorithms for correlation clustering. CoRR, arXiv abs/2202.10747, 2022.
  32. Robust online correlation clustering. In Advances in Neural Information Processing Systems (Neurips), pages 4688–4698, 2021.
  33. Online correlation clustering. In Proceedings of 27th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 573–584, 2010.
  34. Parallel correlation clustering on big graphs. In Advances in Neural Information Processing Systems (Neurips), pages 82–90, 2015.
  35. Approximating CSPs with global cardinality constraints using SDP hierarchies. In Proceedings of the 23d Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 373–387, 2012.
  36. Chaitanya Swamy. Correlation clustering: Maximizing agreements via semidefinite programming. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 526–527, 2004.
  37. Nate Veldt. Correlation clustering via strong triadic closure labeling: Fast approximation algorithms and practical lower bounds. In International Conference on Machine Learning (ICML), pages 22060–22083, 2022.
  38. A correlation clustering framework for community detection. In Proceedings of the 2018 ACM World Wide Web Conference (WWW), pages 439–448, 2018.
  39. Approximation schemes via sherali-adams hierarchy for dense constraint satisfaction problems and assignment problems. In Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS), pages 423–438, 2014.
Citations (14)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up