{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T17:23:50Z","timestamp":1783013030364,"version":"3.54.6"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T00:00:00Z","timestamp":1782950400000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007069","name":"Universit\u00e0 della Calabria","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007069","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2026,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Polarization is common in social systems, where individuals tend to form cohesive groups that oppose each other. Signed networks, with positive edges representing agreement and negative edges representing disagreement, provide a natural model for studying such dynamics. The\n                    <jats:sc>2-Polarized-Communities<\/jats:sc>\n                    problem (\n                    <jats:sc>2pc<\/jats:sc>\n                    ) was recently introduced to detect a single pair of polarized communities by maximizing a Rayleigh quotient that balances intra-community agreement and inter-community disagreement. However, real signed networks usually host multiple, coexisting axes of conflict, often with communities that overlap. Existing extension of\n                    <jats:sc>2pc<\/jats:sc>\n                    to multiple communities or find-and-remove heuristics, either rely on the restrictive assumption that every polarized community is in conflict with all the others, or enforce disjoint solutions\u2013thus failing to capture the nuanced structures observed in real networks. In this paper, we introduce the\n                    <jats:sc>Diverse top-k-pc<\/jats:sc>\n                    problem, which is the first principled formulation of top-\n                    <jats:italic>k<\/jats:italic>\n                    polarized communities with controlled overlap. Our formulation extends the\n                    <jats:sc>2pc<\/jats:sc>\n                    polarity objective by incorporating diversity terms directly into the denominator of the Rayleigh quotient, yielding a generalized objective that jointly promotes polarity and diversity. We design a greedy sequential algorithm that solves a generalized eigenvector problem at each step, efficiently discovering diverse polarized pairs. Experiments on both real-world and synthetic signed networks demonstrate that our approach identifies multiple meaningful and overlapping pairs of polarized communities, outperforming natural baselines while scaling to large graphs.\n                  <\/jats:p>","DOI":"10.1007\/s10994-026-07098-8","type":"journal-article","created":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:57:15Z","timestamp":1783011435000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Top-k Diverse Polarized Communities in Signed Networks"],"prefix":"10.1007","volume":"115","author":[{"given":"Francesco","family":"Gullo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Domenico","family":"Mandaglio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Tagarelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,2]]},"reference":[{"key":"7098_CR1","volume-title":"Elementary Linear Algebra","author":"H Anton","year":"1987","unstructured":"Anton, H. (1987). Elementary Linear Algebra (5th ed.). Wiley.","edition":"5th ed."},{"key":"7098_CR2","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Galimberti, E., Gionis, A., Ordozgoiti, B., & Ruffo, G. (2019). Discovering polarized communities in signed networks. In:\u00a0Proceedings CIKM Conference (pp. 961\u2013970)","DOI":"10.1145\/3357384.3357977"},{"key":"7098_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gionis, A., & Ukkonen, A. (2011). Overlapping correlation clustering. In: Proceedings of IEEE International Conference\u00a0on Data Mining (ICDM) (pp. 51\u201360)","DOI":"10.1109\/ICDM.2011.114"},{"issue":"3","key":"7098_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3086464","volume":"13","author":"A Borodin","year":"2017","unstructured":"Borodin, A., Jain, A., Lee, H. C., & Ye, Y. (2017). Max-sum diversification, monotone submodular functions, and dynamic updates. ACM Transactions on Algorithms, 13(3), 1\u201325.","journal-title":"ACM Transactions on Algorithms"},{"key":"7098_CR5","doi-asserted-by":"crossref","unstructured":"Chiang, K.-Y., Whang, J. J., & Dhillon, I. S. (2012). Scalable clustering of signed networks using balance normalized cut. In:\u00a0Proceedings CIKM Conference (pp. 615\u2013624)","DOI":"10.1145\/2396761.2396841"},{"key":"7098_CR6","doi-asserted-by":"crossref","unstructured":"Chu, L., Wang, Z., Pei, J., Wang, J., Zhao, Z., & Chen, E. (2016). Finding gangs in war from signed networks. In:\u00a0Proceedings KDD Conference, pp. 1505\u20131514","DOI":"10.1145\/2939672.2939855"},{"key":"7098_CR7","doi-asserted-by":"crossref","unstructured":"Conover, M., Ratkiewicz, J., Francisco, M., Goncalves, B., Menczer, F., & Flammini, A. (2011). Political polarization on Twitter. In:\u00a0Proceedings ICWSM Conference (pp. 89\u201396)","DOI":"10.1609\/icwsm.v5i1.14126"},{"key":"7098_CR8","doi-asserted-by":"publisher","first-page":"0263184","DOI":"10.1371\/journal.pone.0263184","volume":"17","author":"M Coscia","year":"2022","unstructured":"Coscia, M., & Rossi, L. (2022). How minimizing conflicts could lead to polarization on social media: An agent-based model investigation. PLOS ONE, 17, 0263184.","journal-title":"PLOS ONE"},{"key":"7098_CR9","unstructured":"Cucuringu, M., Davies, P., Glielmo, A., & Tyagi, H. (2019). SPONGE: A generalized eigenproblem for clustering signed networks. In:\u00a0Proceedings AISTAS Conference (pp. 1088\u20131098)"},{"key":"7098_CR10","doi-asserted-by":"crossref","unstructured":"Derr, T., Ma, Y., & Tang, J. (2018). Signed graph convolutional networks. In:\u00a0Proceedings\u00a0ICDM\u00a0Conference\u00a0(pp. 929\u2013934)","DOI":"10.1109\/ICDM.2018.00113"},{"issue":"5","key":"7098_CR11","first-page":"1134","volume":"30","author":"E Galbrun","year":"2016","unstructured":"Galbrun, E., Gionis, A., & Tatti, N. (2016). Top-k overlapping densest subgraphs. DAMI, 30(5), 1134\u20131165.","journal-title":"DAMI"},{"key":"7098_CR12","doi-asserted-by":"crossref","unstructured":"Garimella, K., De Francisci Morales, G., Gionis, A., & Mathioudakis, M. (2017). Reducing controversy by connecting opposing views. In:\u00a0Proceedings WSDM Conference (pp. 81\u201390)","DOI":"10.1145\/3018661.3018703"},{"key":"7098_CR13","doi-asserted-by":"crossref","unstructured":"Garimella, K., Morales, G. D. F., Gionis, A., & Mathioudakis, M. (2018). Quantifying controversy on social media. TSC, 1(1), 1\u201327.","DOI":"10.1145\/3140565"},{"issue":"9","key":"7098_CR14","doi-asserted-by":"publisher","first-page":"6611","DOI":"10.1007\/s10994-024-06581-4","volume":"113","author":"F Gullo","year":"2024","unstructured":"Gullo, F., Mandaglio, D., & Tagarelli, A. (2024). Neural discovery of balance-aware polarized communities. Machine Learning, 113(9), 6611\u20136644.","journal-title":"Machine Learning"},{"issue":"2","key":"7098_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3779064","volume":"20","author":"F Gullo","year":"2026","unstructured":"Gullo, F., Mandaglio, D., & Tagarelli, A. (2026). Polarized communities meet densest subgraph: Efficient and effective polarization detection in signed networks. ACM Transactions on Knowledge Discovery from Data, 20(2), 1\u201326. https:\/\/doi.org\/10.1145\/3779064","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"7098_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary, F. (1953). On the notion of balance of a signed graph. Michigan Mathematical Journal, 2, 143\u2013146.","journal-title":"Michigan Mathematical Journal"},{"key":"7098_CR17","doi-asserted-by":"crossref","unstructured":"He, Y., Reinert, G., Wang, S., & Cucuringu, M. (2022). SSSNET: semi-supervised signed network clustering. In: Proceedings SDM Conference\u00a0(pp. 244\u2013252)","DOI":"10.1137\/1.9781611977172.28"},{"issue":"9","key":"7098_CR18","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abq2044","volume":"9","author":"M Hohmann","year":"2023","unstructured":"Hohmann, M., Devriendt, K., & Coscia, M. (2023). Quantifying ideological polarization on a network using generalized Euclidean distance. Science Advances, 9(9), Article eabq2044.","journal-title":"Science Advances"},{"key":"7098_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R. A., & Johnson, C. R. (2012). Matrix Analysis (2nd ed.). Cambridge University Press.","edition":"2nd ed."},{"key":"7098_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, S., Hamilton, W. L., Leskovec, J., & Jurafsky, D. (2018). Community interaction and conflict on the Web. In:\u00a0Proceedings WWW Conference\u00a0(pp. 933\u2013943)","DOI":"10.1145\/3178876.3186141"},{"key":"7098_CR21","doi-asserted-by":"crossref","unstructured":"Kunegis, J. (2013). KONECT \u2013 The Koblenz Network Collection. In:\u00a0Proceedings\u00a0WWW\u00a0Conference, pp. 1343\u20131350 . http:\/\/konect.cc","DOI":"10.1145\/2487788.2488173"},{"key":"7098_CR22","doi-asserted-by":"crossref","unstructured":"Kunegis, J., Schmidt, S., Lommatzsch, A., Lerner, J., Luca, E. W. D., & Albayrak, S. (2010). Spectral analysis of signed graphs for clustering, prediction and visualization. In:\u00a0Proceedings SDM Conference\u00a0(pp. 559\u2013570)","DOI":"10.1137\/1.9781611972801.49"},{"key":"7098_CR23","doi-asserted-by":"crossref","unstructured":"La Cava, L., Mandaglio, D., & Tagarelli, D. (2024). Polarization in decentralized online social networks. In:\u00a0Proceedings\u00a0of the ACM Web Science Conference (pp. 48\u201352)","DOI":"10.1145\/3614419.3644013"},{"key":"7098_CR24","doi-asserted-by":"crossref","unstructured":"Lai, M., Patti, V., Ruffo, G., & Rosso, P. (2018). Stance evolution and twitter interactions in an Italian political debate. In: Proceedings NLDB Conference, (pp. 15\u201327)","DOI":"10.1007\/978-3-319-91947-8_2"},{"issue":"S1","key":"7098_CR25","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1093\/poq\/nfw005","volume":"80","author":"Y Lelkes","year":"2016","unstructured":"Lelkes, Y. (2016). Mass polarization: Manifestations and measurements. Public Opinion Quarterly, 80(S1), 392\u2013410.","journal-title":"Public Opinion Quarterly"},{"key":"7098_CR26","unstructured":"Leskovec, J., & Krevl, A. (2014). SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data"},{"key":"7098_CR27","doi-asserted-by":"crossref","unstructured":"Liu, H., Zhang, Z., Cui, P., Zhang, Y., Cui, Q., Liu, J., & Zhu, W. (2021). Signed graph neural network with latent groups. In:\u00a0Proceedings KDD Conference, pp. 1066\u20131075","DOI":"10.1145\/3447548.3467355"},{"key":"7098_CR28","unstructured":"Mercado, P., Tudisco, F., & Hein, M. (2016). Clustering signed networks with the geometric mean of laplacians. In:\u00a0Proceedings NIPS Conference\u00a0(pp. 4421\u20134429)"},{"key":"7098_CR29","doi-asserted-by":"crossref","unstructured":"Nettasinghe, B., Rao, A., Jiang, B., Percus, A. G., & Lerman, K. (2025). In-group love, out-group hate: A framework to measure affective polarization via contentious online discussions. In:\u00a0Proceedings WWW Conference\u00a0(pp. 560\u2013575)","DOI":"10.1145\/3696410.3714935"},{"key":"7098_CR30","doi-asserted-by":"crossref","unstructured":"Niu, J., & Sariy\u00fcce, A. E. (2023). On cohesively polarized communities in signed networks. In:\u00a0Proceedings WWW Conference\u00a0(pp. 1339\u20131347)","DOI":"10.1145\/3543873.3587698"},{"key":"7098_CR31","doi-asserted-by":"crossref","unstructured":"Ordozgoiti, B., Matakos, A., & Gionis, A. (2020). Finding large balanced subgraphs in signed networks. In:\u00a0Proceedings WWW Conference\u00a0(pp. 1378\u20131388)","DOI":"10.1145\/3366423.3380212"},{"key":"7098_CR32","doi-asserted-by":"crossref","unstructured":"Sedoc, J., Gallier, J., Foster, D., & Ungar, L. (2017). Semantic word clusters using signed spectral clustering. In: Proceedings ACL Conference\u00a0(pp. 939\u2013949)","DOI":"10.18653\/v1\/P17-1087"},{"key":"7098_CR33","first-page":"10974","volume":"33","author":"R-C Tzeng","year":"2020","unstructured":"Tzeng, R.-C., Ordozgoiti, B., & Gionis, A. (2020). Discovering conflicting groups in signed networks. Advances in Neural Information Processing Systems, 33, 10974\u201310985.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"7098_CR34","doi-asserted-by":"crossref","unstructured":"Xiao, H., Ordozgoiti, B., & Gionis, A. (2020). Searching for polarization in signed graphs: A local spectral approach. In:\u00a0Proceedings WWW Conference\u00a0(pp. 362\u2013372)","DOI":"10.1145\/3366423.3380121"},{"key":"7098_CR35","doi-asserted-by":"crossref","unstructured":"Zhao, P., Li, X., Zhang, Z., Wang, M., Zhu, X., & Liao, L. (2025). Robust deep signed graph clustering via weak balance theory. In:\u00a0Proceedings WWW Conference, pp. 3819\u20133830","DOI":"10.1145\/3696410.3714915"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-026-07098-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-026-07098-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:57:56Z","timestamp":1783011476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-026-07098-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":35,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["7098"],"URL":"https:\/\/doi.org\/10.1007\/s10994-026-07098-8","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"14 February 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests as defined by Springer, or other interests that might be perceived to influence the results and\/or discussion reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"We declare that this research did not require Ethics approval.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to Participate"}},{"value":"All the authors of this manuscript consent to its publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"166"}}