Abstract
Correlation clustering problem is a classical clustering problem and has many applications in protein interaction networks, cross-lingual link detection, communication networks, etc. In this paper, we discuss the capacitated correlation clustering problem on labeled complete graphs, in which each edge is labeled \(+\) or − to indicate two endpoints are “similar" or “dissimilar", respectively. Our objective is to partition the vertex set into several clusters, subject to an upper bound on cluster size, so as to minimize the number of disagreements. Here the number of disagreements is defined as the total number of the edges with positive labels between clusters and the edges with negative labels within clusters. The main contribution of this work is providing a 5.37-approximation algorithm for the capacitated correlation clustering problem, improving the current best approximation ratio of 6 [21]. In addition, we have conducted a series of numerical experiments, which effectively demonstrate the effectiveness of our algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ailon, N., Avigdor-Elgrabli, N., Liberty, E., Zuylen, A.V.: Improved approximation algorithms for bipartite correlation clustering. SIAM J. Comput. 41(5), 1110–1121 (2012)
Ahn, K.J., Cormode, G., Guha, S., Mcgregor, A., Wirth, A.: Correlation clustering in data streams. In: Proceedings of the 32nd International Conference on Machine Learning, pp. 2237–2246 (2015)
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 1–27 (2008)
Ahmadi, S., Khuller, S., Saha, B.: Min-max correlation clustering via multicut. In: Proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, pp. 13–26 (2019)
Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J. : Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms. In: Proceedings of the 58th Annual Symposium on Foundations of Computer Science, pp. 61–72 (2017)
Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1–3), 89–113 (2004)
Bressan, M., Cesa-Bianchi, N., Paudice, A., Vitale, F.: Correlation clustering with adaptive similarity queries. In: Proceedings of the 32nd Annual Conference on Neural Information Processing Systems, pp. 12510–12519 (2019)
Bonchi, F., Gionis, A., Ukkonen, A.: Overlapping correlation clustering. Knowl. Inf. Syst. 35(1), 1–32 (2013)
Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: Proceedings of the 37th International Conference on Machine Learning, pp. 405–413 (2019)
Cohen-Addad, V.: Approximation schemes for capacitated clustering in doubling metrics. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2241–2259 (2020)
Choo, D., Grunau, C., Portmann, J., Rozhon, V.: \(k\)-means++: few more steps yield constant approximation. In: Proceedings of the 37th International Conference on Machine Learning, pp. 1909–1917 (2020)
Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 3(71), 360–383 (2005)
Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for \(k\)-means and \(k\)-median in Euclidean and minor-free metrics. SIAM J. Comput. 48(2), 644–667 (2019)
Chawla, S., Makarychev, K., Schramm, T., Yaroslavtsev, G.: 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 (2015)
Castro, J., Nasini, S., Saldanha-Da-Gama, F.: A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method. Math. Program. 163(1–2), 411–444 (2021)
Filippi, C., Guastaroba, G., Speranza, M.G.: On single-source capacitated facility location with cost and fairness objectives. Eur. J. Oper. Res. 289(3), 959–974 (2021)
Kim, S., Yoo, C.D., Nowozin, S., Kohli, P.: Image segmentation using higher-order correlation clustering. IEEE Trans. Patt. Anal. Mach. Intell. 36(9), 1761–1774 (2014)
Lange, J.H., Karrenbauer, A., Andres, B.: Partial optimality and fast lower bounds for weighted correlation clustering. In: Proceedings of the 35th International Conference on International Conference on Machine Learning, pp. 2892–2901 (2018)
Li, S., Svensson, O.: Approximating \(k\)-median via pseudo-approximation. SIAM J. Comput. 45(2), 530–547 (2016)
Mathieu, C., Schudy, W.: Correlation clustering with noisy input. In: Proceedings of the 21th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 712–728 (2010)
Puleo, G.J., Milenkovic, O.: Correlation clustering with constrained cluster sizes and extended weights bounds. SIAM J. Optim. 25(3), 1857–1872 (2015)
Thiel, E., Chehreghani, M.H., Dubhashi, D.: A non-convex optimization approach to correlation clustering. In: Proceedings of the 33rd AAAI Conference on Artificial Intelligence, pp. 5159–5166 (2019)
Veldt, N., Wirth, A., Gleich, D.F.: Parameterized correlation clustering in hypergraphs and bipartite graphs. Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1868–1876 (2020)
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 Nature Science Foundation of China (No. 11871366), Qing Lan Project for Young Academic Leaders and Qing Lan Project for Key Teacher. The third author is supported by Natural Science Foundation of Shandong Province (No. ZR2017LA002). The fourth author is supported by National Natural Science Foundation of China (No. 12131003) and Beijing Natural Science Foundation Project No. Z200002.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Ji, S., Cheng, Y., Tan, J., Zhao, Z. (2021). An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem. In: Du, DZ., Du, D., Wu, C., Xu, D. (eds) Combinatorial Optimization and Applications. COCOA 2021. Lecture Notes in Computer Science(), vol 13135. Springer, Cham. https://doi.org/10.1007/978-3-030-92681-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-92681-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92680-9
Online ISBN: 978-3-030-92681-6
eBook Packages: Computer ScienceComputer Science (R0)