Skip to main content

Approximation algorithms for the lower bounded correlation clustering problem

Journal of Combinatorial Optimization volume 45, Article number: 43 (2023) Cite this article

Abstract

Lower bounded correlation clustering problem (LBCorCP) is a new generalization of the correlation clustering problem (CorCP). In the LBCorCP, we are given an integer L and a complete labelled graph. Each edge in the graph is either positive or negative based on the similarity of its two endpoints. The goal is to find a clustering of the vertices, each cluster contains at least L vertices, so as to minimize the sum of the number of positive cut edges and negative uncut edges. In this paper, we first introduce the LBCorCP and give three algorithms for this problem. The first algorithm is a random algorithm, which is designed for the instances of the LBCorCP with fewer positive edges. The second one is that we let the set V itself as a cluster and prove that the algorithm works well on two specially instances with fewer negative edges. The last one is an LP-rounding based iterative algorithm, which is also provided for the instances with fewer negative edges. The above three algorithms can quickly solve some special instances in polynomial time and obtain a smaller approximation ratio. In addition, we conduct simulations to evaluate the performance of our algorithms.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

USD 39.95

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Data availability

Enquiries about data availability should be directed to the authors.

Notes

  1. https://github.com/Junhaodada/Approximation-algorithms-for-the-lower-bounded-correlation-clustering-problem

References

  • Ahmadi S, Khuller S, Saha B (2019) Min-max correlation clustering via multicut. In: Proceedings of the 20th international conference on integer programming and combinatorial optimization, pp 13–26

  • Ahmadian S, Swamy C (2012) Improved approximation guarantees for lower-bounded facility location. In: Proceedings of the 10th international workshop on approximation and online algorithms, pp 257–271

  • Ailon N, Avigdor-Elgrabli N, Liberty E, Zuylen AV (2012) Improved approximation algorithms for bipartite correlation clustering. SIAM J Comput 41(5):1110–1121

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Bonchi F, Gionis A, Ukkonen A (2013) Overlapping correlation clustering. Knowl Inf Syst 35(1):1–32

    Article  Google Scholar 

  • Bonchi F, Gionis A, Gullo F, Tsourakakis CE, Ukkonen A (2015) Chromatic correlation clustering. ACM Trans Knowl Discov Data 9(4):1–24

    Article  Google Scholar 

  • Charikar M, Guruswami V, Wirth A (2005) Clustering with qualitative information. J Comput Syst Sci 71(3):360–383

    Article  MathSciNet  MATH  Google Scholar 

  • Chawla S, Makarychev K, Schramm T, Yaroslavtsev G (2015) Near optimal LP rounding algorithm for correlation clustering on complete and complete \(k\)-partite graphs. In: Proceedings of the 47th ACM symposium on theory of computing, pp 219–228

  • Fukunaga T (2019) LP-based pivoting algorithm for higher-order correlation clustering. J Comb Optim 37(4):1312–1326

    Article  MathSciNet  MATH  Google Scholar 

  • Han L, Hao C, Wu C, Zhang Z (2020) Approximation algorithms for the lower-bounded \(k\)-median and its generalizations. In: Proceedings of the 26th international computing and combinatorics conference, pp 627–639

  • Jafarov J, Kalhan S, Makarychev K, Makarychev Y (2020) Correlation clustering with asymmetric classification errors. In: Proceedings of the 37th international conference on machine learning, pp 4641–4650

  • Li S (2019) On facility location with general lower bounds. In: Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, pp 2279–2290

  • Li P, Puleo GJ, Milenkovic O (2019) Motif and hypergraph correlation clustering. IEEE Trans Inf Theory 66(5):3065–3078

    Article  MathSciNet  MATH  Google Scholar 

  • Makarychev K, Makarychev Y, Vijayaraghavan A (2015) Correlation clustering with noisy partial information. In: Proceedings of the 28th annual conference computational learning theory, pp 1321–1342

  • Mathieu C, Schudy W (2010) Correlation clustering with noisy input. In: Proceedings of the 21th annual ACM-SIAM symposium on discrete algorithms, pp 712–728

  • Puleo GJ, Milenkovic O (2015) Correlation clustering with constrained cluster sizes and extended weights bounds. SIAM J Optim 25(3):1857–1872

    Article  MathSciNet  MATH  Google Scholar 

  • Saha B, Subramanian S (2019) Correlation clustering with same-cluster queries bounded by optimal cost. In: Proceedings of the 27th annual European symposium on algorithms, pp 81:1–81:17

  • Svitkina Z (2010) Lower-bounded facility location. ACM Trans Algorithms 6(4):1–16

    Article  MathSciNet  MATH  Google Scholar 

  • Swamy C (2004) Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms, pp 526–527

  • Veldt N, Gleich DF, Wirth A (2018) A correlation clustering framework for community detection. In: Proceedings of the 27th world wide web conference, pp 439–448

Download references

Acknowledgements

The first author is supported by National Natural Science Foundation of China (No. 12101594) and the Project funded by China Postdoctoral Science Foundation (No. 2021M693337). The second author is supported by National Office for Philosophy and Social Sciences (No. 20BGL259). The third author is supported by the NSERC (06446) and National Natural Science Foundation of China (Nos. 11771386, 11971349, 71771117). The fourth and the fifth authors are supported by National Natural Science Foundation of China (No. 11871081).

Funding

The authors have not disclosed any funding.

Author information

Authors and Affiliations

  1. Institute of Mathematics, Hebei University of Technology, Tianjin, 300401, People’s Republic of China

    Sai Ji

  2. School of Public Administration, Hainan University, Haikou, 570228, Hainan, People’s Republic of China

    Yinhong Dong

  3. Faculty of Business Administration, University of New Brunswick, Fredericton, NB, E3B 5A3, Canada

    Donglei Du

  4. Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing, 100124, People’s Republic of China

    Dongzhao Wang & Dachuan Xu

Authors
  1. Sai Ji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yinhong Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Donglei Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dongzhao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Dachuan Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dachuan Xu.

Ethics declarations

Competing interests

The authors have not disclosed any competing interests.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A preliminary version of this paper appeared in Proceedings of the 10th International Conference on Computational Data and Social Networks, pp. 39–49, 2021.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Ji, S., Dong, Y., Du, D. et al. Approximation algorithms for the lower bounded correlation clustering problem. J Comb Optim 45, 43 (2023). https://doi.org/10.1007/s10878-022-00976-6

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10878-022-00976-6

Keywords

  • Lower bounded
  • Correlation clustering
  • Approximation algorithm
  • LP-rounding
  • Polynomial time