{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T10:28:39Z","timestamp":1776680919435,"version":"3.51.2"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030865191","type":"print"},{"value":"9783030865207","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86520-7_31","type":"book-chapter","created":{"date-parts":[[2021,9,9]],"date-time":"2021-09-09T15:25:48Z","timestamp":1631201148000},"page":"499-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Correlation Clustering with Global Weight Bounds"],"prefix":"10.1007","author":[{"given":"Domenico","family":"Mandaglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Tagarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"key":"31_CR1","unstructured":"Abraham, S.S., Sundaram, S.S.: Fairness in clustering with multiple sensitive attributes. In: Proceedings of EDBT Conference, pp. 287\u2013298 (2020)"},{"key":"31_CR2","unstructured":"Ahmadian, S., et al.: Fair hierarchical clustering. In: Proceedings of NIPS Conference (2020)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Ahmadian, S., Epasto, A., Kumar, R., Mahdian, M.: Clustering without over-representation. In: Proceedings of ACM KDD Conference, pp. 267\u2013275 (2019)","DOI":"10.1145\/3292500.3330987"},{"key":"31_CR4","unstructured":"Ahmadian, S., Epasto, A., Kumar, R., Mahdian, M.: Fair correlation clustering. In: Proceedings of AISTATS Conference, pp. 4195\u20134205 (2020)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. JACM 55(5), 23:1\u201323:27 (2008)","DOI":"10.1145\/1411509.1411513"},{"key":"31_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., Kann, V.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-58412-1"},{"key":"31_CR7","unstructured":"Backurs, A., Indyk, P., Onak, K., Schieber, B., Vakilian, A., Wagner, T.: Scalable fair clustering. In: Proceedings of ICML Conference, pp. 405\u2013413 (2019)"},{"issue":"1","key":"31_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"31_CR9","unstructured":"Bera, S.K., Chakrabarty, D., Flores, N., Negahbani, M.: Fair algorithms for clustering. In: Proceedings of NIPS Conference, pp. 4955\u20134966 (2019)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Garc\u00eda-Soriano, D., Liberty, E.: Correlation clustering: from theory to practice. In: Proceedings of ACM KDD Conference, p. 1972 (2014)","DOI":"10.1145\/2623330.2630808"},{"issue":"3","key":"31_CR11","first-page":"360","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. JCSS 71(3), 360\u2013383 (2005)","journal-title":"JCSS"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"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 ACM STOC Symposium, pp. 219\u2013228 (2015)","DOI":"10.1145\/2746539.2746604"},{"key":"31_CR13","unstructured":"Chen, X., Fain, B., Lyu, L., Munagala, K.: Proportionally fair clustering. In: Proceedings of ICML Conference, pp. 1032\u20131041 (2019)"},{"key":"31_CR14","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: Proceedings of NIPS Conference, pp. 5029\u20135037 (2017)"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Crescenzi, P.: A short guide to approximation preserving reductions. In: Proceedings of IEEE CCC Conference, pp. 262\u2013273 (1997)","DOI":"10.1109\/CCC.1997.612321"},{"issue":"2\u20133","key":"31_CR16","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2006.05.008","volume":"361","author":"ED Demaine","year":"2006","unstructured":"Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. TCS 361(2\u20133), 172\u2013187 (2006)","journal-title":"TCS"},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1217299.1217303","volume":"1","author":"A Gionis","year":"2007","unstructured":"Gionis, A., Mannila, H., Tsaparas, P.: Clustering aggregation. ACM TKDD 1(1), 4 (2007)","journal-title":"ACM TKDD"},{"key":"31_CR18","unstructured":"Kleindessner, M., Awasthi, P., Morgenstern, J.: Fair k-center clustering for data summarization. In: Proceedings of ICML Conference, pp. 3448\u20133457 (2019)"},{"key":"31_CR19","unstructured":"Kleindessner, M., Samadi, S., Awasthi, P., Morgenstern, J.: Guarantees for spectral clustering with fairness constraints. In: Proceedings of ICML Conference, pp. 3458\u20133467 (2019)"},{"issue":"2","key":"31_CR20","first-page":"325","volume":"25","author":"G Kollios","year":"2013","unstructured":"Kollios, G., Potamias, M., Terzi, E.: Clustering large probabilistic graphs. IEEE TKDE 25(2), 325\u2013336 (2013)","journal-title":"IEEE TKDE"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Mandaglio, D., Tagarelli, A., Gullo, F.: In and out: optimizing overall interaction in probabilistic graphs under clustering constraints. In: Proceedings of ACM KDD Conference, pp. 1371\u20131381 (2020)","DOI":"10.1145\/3394486.3403190"},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"e12229","DOI":"10.1111\/exsy.12229","volume":"35","author":"D Pandove","year":"2018","unstructured":"Pandove, D., Goel, S., Rani, R.: Correlation clustering methodologies and their fundamental results. Expert. Syst. 35(1), e12229 (2018)","journal-title":"Expert. Syst."},{"issue":"3","key":"31_CR23","doi-asserted-by":"publisher","first-page":"1857","DOI":"10.1137\/140994198","volume":"25","author":"GJ Puleo","year":"2015","unstructured":"Puleo, G.J., Milenkovic, O.: Correlation clustering with constrained cluster sizes and extended weights bounds. SIAM J. Optim. 25(3), 1857\u20131872 (2015)","journal-title":"SIAM J. Optim."},{"key":"31_CR24","unstructured":"R\u00f6sner, C., Schmidt, M.: Privacy preserving clustering with constraints. In: Proceedings of ICALP Colloquium, vol. 107, pp. 96:1\u201396:14 (2018)"},{"issue":"1\u20132","key":"31_CR25","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discret. Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discret. Appl. Math."},{"key":"31_CR26","unstructured":"Swamy, C.: Correlation clustering: maximizing agreements via semidefinite programming. In: Proceedings of ACM-SIAM SODA Conference, pp. 526\u2013527 (2004)"},{"key":"31_CR27","doi-asserted-by":"crossref","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Proceedings of WAOA, pp. 260\u2013273 (2007)","DOI":"10.1007\/978-3-540-77918-6_21"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases. Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86520-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T22:05:32Z","timestamp":1757369132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86520-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030865191","9783030865207"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86520-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2021.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"869","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"210","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}