{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:20:38Z","timestamp":1783578038012,"version":"3.55.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T00:00:00Z","timestamp":1778284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006692","name":"Universit\u00e0 degli Studi di Torino","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006692","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2026,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Co-clustering refers to the simultaneous clustering of rows and columns in a data matrix, uncovering joint patterns between two distinct sets, such as documents and terms or users and products. Traditional co-clustering algorithms typically rely on discrete optimization techniques based on enumeration, which can limit both scalability and flexibility. In this paper, we introduce a differentiable programming approach to co-clustering that enables the continuous optimization of co-partitions using graph neural networks. Our method is grounded in an associative co-clustering quality measure that is independent of the number of clusters and dynamically adjusts this parameter by jointly considering both partitions. By leveraging automatic differentiation and graph neural networks, our approach scales to very large datasets while maintaining high-quality co-cluster structures. We evaluate our method using different types of graph neural networks and initialization strategies. Furthermore, when compared with recent state-of-the-art methods for co-clustering and graph clustering, our approach achieves competitive or superior results in terms of accuracy. Most importantly, it is the only algorithm that successfully completes on the largest benchmark dataset.<\/jats:p>","DOI":"10.1007\/s10618-026-01211-0","type":"journal-article","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T07:36:33Z","timestamp":1778312193000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Differentiable parameter-less co-clustering using graph neural networks"],"prefix":"10.1007","volume":"40","author":[{"given":"Alessio","family":"Ragno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre-Angelo","family":"Peyrie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Plantevit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruggero G.","family":"Pensa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9line","family":"Robardet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"1211_CR1","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/J.PATCOG.2017.06.005","volume":"72","author":"M Ailem","year":"2017","unstructured":"Ailem M, Role F, Nadif M (2017) Model-based co-clustering for the effective handling of sparse data. Pattern Recognit 72:108\u2013122. https:\/\/doi.org\/10.1016\/J.PATCOG.2017.06.005","journal-title":"Pattern Recognit"},{"issue":"4","key":"1211_CR2","doi-asserted-by":"publisher","first-page":"2153","DOI":"10.1007\/S10994-023-06474-Y","volume":"113","author":"E Battaglia","year":"2024","unstructured":"Battaglia E, Peiretti F, Pensa RG (2024) Fast parameterless prototype-based co-clustering. Mach Learn 113(4):2153\u20132181. https:\/\/doi.org\/10.1007\/S10994-023-06474-Y","journal-title":"Mach Learn"},{"key":"1211_CR3","doi-asserted-by":"publisher","unstructured":"Battaglia E, Peiretti F, Pensa RG (2025) Co-clustering: a survey of the main methods, recent trends, and open problems. ACM Comput Surv 57(2):48:1\u201348:33. https:\/\/doi.org\/10.1145\/3698875","DOI":"10.1145\/3698875"},{"key":"1211_CR4","unstructured":"Bianchi FM, Grattarola D, Alippi C (2020) Spectral clustering with graph neural networks for graph pooling. In: Proceedings of ICML 2020, vol 119. PMLR, pp 874\u2013883"},{"issue":"2","key":"1211_CR5","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/S00357-023-09441-3","volume":"40","author":"C Biernacki","year":"2023","unstructured":"Biernacki C, Jacques J, Keribin C (2023) A survey on model-based co-clustering: high dimension and estimation challenges. J Classif 40(2):332\u2013381. https:\/\/doi.org\/10.1007\/S00357-023-09441-3","journal-title":"J Classif"},{"key":"1211_CR6","doi-asserted-by":"publisher","unstructured":"Chataing T, Perez J, Plantevit M, et\u00a0al (2024) Diffversify: a scalable approach to differentiable pattern mining with coverage regularization. In: Proceedings of ECML PKDD 2024, LNCS, vol 14946. Springer, pp 407\u2013422, https:\/\/doi.org\/10.1007\/978-3-031-70365-2_24","DOI":"10.1007\/978-3-031-70365-2_24"},{"key":"1211_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/502512.502550","volume":"2001","author":"IS Dhillon","year":"2001","unstructured":"Dhillon IS (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of ACM SIGKDD 2001:269\u2013274. https:\/\/doi.org\/10.1145\/502512.502550","journal-title":"Proceedings of ACM SIGKDD"},{"key":"1211_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/956750.956764","volume":"2003","author":"IS Dhillon","year":"2003","unstructured":"Dhillon IS, Mallela S, Modha DS (2003) Information-theoretic co-clustering. In: Proceedings of ACM SIGKDD 2003:89\u201398. https:\/\/doi.org\/10.1145\/956750.956764","journal-title":"Proceedings of ACM SIGKDD"},{"key":"1211_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/1150402.1150420","volume":"2006","author":"CHQ Ding","year":"2006","unstructured":"Ding CHQ, Li T, Peng W et al (2006) Orthogonal nonnegative matrix t-factorizations for clustering. In: Proceedings of ACM SIGKDD 2006:126\u2013135. https:\/\/doi.org\/10.1145\/1150402.1150420","journal-title":"Proceedings of ACM SIGKDD"},{"key":"1211_CR10","doi-asserted-by":"publisher","first-page":"4623","DOI":"10.1109\/TSP.2021.3101979","volume":"69","author":"S Du","year":"2021","unstructured":"Du S, Liu Z, Chen Z et al (2021) Differentiable bi-sparse multi-view co-clustering. IEEE Trans Signal Process 69:4623\u20134636. https:\/\/doi.org\/10.1109\/TSP.2021.3101979","journal-title":"IEEE Trans Signal Process"},{"key":"1211_CR11","doi-asserted-by":"crossref","unstructured":"Fettal C, Labiod L, Nadif M (2022) Efficient and effective optimal transport-based biclustering. In: Proceedings of NeurIPS 2022","DOI":"10.52202\/068431-2390"},{"issue":"3","key":"1211_CR12","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/TKDE.2023.3300814","volume":"36","author":"C Fettal","year":"2024","unstructured":"Fettal C, Labiod L, Nadif M (2024) Boosting subspace co-clustering via bilateral graph convolution. IEEE Trans Knowl Data Eng 36(3):960\u2013971. https:\/\/doi.org\/10.1109\/TKDE.2023.3300814","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1211_CR13","first-page":"732","volume":"49","author":"LA Goodman","year":"1954","unstructured":"Goodman LA, Kruskal WH (1954) Measures of association for cross classification. J Amer Statist Ass 49:732\u2013764","journal-title":"J Amer Statist Ass"},{"issue":"3","key":"1211_CR14","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1080\/03610920903140197","volume":"39","author":"G Govaert","year":"2010","unstructured":"Govaert G, Nadif M (2010) Latent block model for contingency table. Commun Stat\u2014Theory Methods 39(3):416\u2013425. https:\/\/doi.org\/10.1080\/03610920903140197","journal-title":"Commun Stat - Theory Methods"},{"issue":"9","key":"1211_CR15","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. Mach Learn 113(9):6611\u20136644. https:\/\/doi.org\/10.1007\/S10994-024-06581-4","journal-title":"Mach Learn"},{"key":"1211_CR16","doi-asserted-by":"publisher","unstructured":"Haseena\u00a0Rahmath P, Srivastava V, Chaurasia K, et\u00a0al (2025) Early-exit deep neural network\u2014a comprehensive survey. ACM Comput Surv 57(3):75:1\u201375:37. https:\/\/doi.org\/10.1145\/3698767","DOI":"10.1145\/3698767"},{"key":"1211_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert L, Arabie P (1985) Comparing partitions. J Classif 2:193\u2013218","journal-title":"Comparing partitions J Classif"},{"key":"1211_CR18","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: Proceedings of ICLR 2017"},{"key":"1211_CR19","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1101\/gr.648603","volume":"13","author":"Y Kluger","year":"2003","unstructured":"Kluger Y, Basri R, Chang JT et al (2003) Spectral biclustering of microarray cancer data: co-clustering genes and conditions. Genome Res 13:703\u2013716. https:\/\/doi.org\/10.1101\/gr.648603","journal-title":"Genome Res"},{"key":"1211_CR20","first-page":"1955","volume":"2017","author":"C Laclau","year":"2017","unstructured":"Laclau C, Redko I, Matei B et al (2017) Co-clustering through optimal transport. In: Proceedings of ICML 2017:1955\u20131964","journal-title":"Proceedings of ICML"},{"key":"1211_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/ICIP.2003.1246944","volume":"2003","author":"Y Li","year":"2003","unstructured":"Li Y, Xu L, Morphett J et al (2003) An integrated algorithm of incremental and robust PCA. In: Proceedings of ICIP 2003:245\u2013248. https:\/\/doi.org\/10.1109\/ICIP.2003.1246944","journal-title":"Proceedings of ICIP"},{"key":"1211_CR22","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1145\/1081870.1081949","volume":"2005","author":"B Long","year":"2005","unstructured":"Long B, Zhang ZM, Yu PS (2005) Co-clustering by block value decomposition. In: Proceedings of ACM SIGKDD 2005:635\u2013640. https:\/\/doi.org\/10.1145\/1081870.1081949","journal-title":"Proceedings of ACM SIGKDD"},{"issue":"4","key":"1211_CR23","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1080\/10618600.2024.2319162","volume":"33","author":"G Marchello","year":"2024","unstructured":"Marchello G, Corneli M, Bouveyron C (2024) A deep dynamic latent block model for co-clustering of zero-inflated data matrices. J Comput Graph Stat 33(4):1224\u20131239. https:\/\/doi.org\/10.1080\/10618600.2024.2319162","journal-title":"J Comput Graph Stat"},{"key":"1211_CR24","doi-asserted-by":"publisher","unstructured":"Robardet C, Feschet F (2001a) Comparison of three objective functions for conceptual clustering. In: Proceedings of PKDD 2001, LNCS, vol 2168. Springer, pp 399\u2013410, https:\/\/doi.org\/10.1007\/3-540-44794-6_33","DOI":"10.1007\/3-540-44794-6_33"},{"key":"1211_CR25","doi-asserted-by":"publisher","unstructured":"Robardet C, Feschet F (2001b) Efficient local search in conceptual clustering. In: Proceedings of DS 2001, LNCS, vol 2226. Springer, pp 323\u2013335, https:\/\/doi.org\/10.1007\/3-540-45650-3_28","DOI":"10.1007\/3-540-45650-3_28"},{"key":"1211_CR26","doi-asserted-by":"publisher","unstructured":"Role F, Morbieu S, Nadif M (2019) Coclust: a python package for co-clustering. J Stat Softw 88(7):1\u201329. https:\/\/doi.org\/10.18637\/jss.v088.i07","DOI":"10.18637\/jss.v088.i07"},{"key":"1211_CR27","doi-asserted-by":"publisher","unstructured":"Shishkin SL, Shalaginov A, Bopardikar SD (2019) Fast approximate truncated SVD. Numer Linear Algebra Appl 26(4). https:\/\/doi.org\/10.1002\/nla.2246","DOI":"10.1002\/nla.2246"},{"key":"1211_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/J.PATCOG.2025.112117","volume":"171","author":"DK Singh","year":"2026","unstructured":"Singh DK, Boubekki A, Jenssen R et al (2026) SuperCM: improving semi-supervised learning and domain adaptation through differentiable clustering. Pattern Recognit 171:112117. https:\/\/doi.org\/10.1016\/J.PATCOG.2025.112117","journal-title":"Pattern Recognit"},{"key":"1211_CR29","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl A, Ghosh J (2002) Cluster ensembles\u2014a knowledge reuse framework for combining multiple partitions. J Mach Learn Res 3:583\u2013617","journal-title":"J Mach Learn Res"},{"key":"1211_CR30","unstructured":"Tsitsulin A, Palowitch J, Perozzi B, et\u00a0al (2023) Graph clustering with graph neural networks. J Mach Learn Res 24:127:1\u2013127:21"},{"key":"1211_CR31","unstructured":"Velickovic P, Cucurull G, Casanova A, et\u00a0al (2018) Graph attention networks. In: Proceedings of ICLR 2018"},{"key":"1211_CR32","doi-asserted-by":"publisher","first-page":"9062","DOI":"10.1609\/AAAI.V38I8.28756","volume":"2024","author":"NP Walter","year":"2024","unstructured":"Walter NP, Fischer J, Vreeken J (2024) Finding interpretable class-specific patterns through efficient neural search. In: Proceedings of AAAI 2024:9062\u20139070. https:\/\/doi.org\/10.1609\/AAAI.V38I8.28756","journal-title":"Proceedings of AAAI"},{"key":"1211_CR33","doi-asserted-by":"publisher","unstructured":"Wang H, Song Y, Chen W, et\u00a0al (2024) A survey of co-clustering. ACM Trans Knowl Discov Data 18(9):224:1\u2013224:28. https:\/\/doi.org\/10.1145\/3681793","DOI":"10.1145\/3681793"},{"key":"1211_CR34","doi-asserted-by":"publisher","first-page":"1353","DOI":"10.1145\/3696410.3714652","volume":"2025","author":"K Xie","year":"2025","unstructured":"Xie K, Yang R, Wang S (2025) Diffusion-based graph-agnostic clustering. In: Proceedings of the ACM Web Conference 2025:1353\u20131364. https:\/\/doi.org\/10.1145\/3696410.3714652","journal-title":"Proceedings of the ACM Web Conference"},{"key":"1211_CR35","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/1.9781611975673.47","volume":"2019","author":"D Xu","year":"2019","unstructured":"Xu D, Cheng W, Zong B et al (2019) Deep co-clustering. In: Proceedings of SIAM SDM 2019:414\u2013422. https:\/\/doi.org\/10.1137\/1.9781611975673.47","journal-title":"Proceedings of SIAM SDM"},{"key":"1211_CR36","unstructured":"Xu K, Hu W, Leskovec J, et\u00a0al (2019b) How powerful are graph neural networks? In: Proceedings of ICLR 2019"},{"issue":"5","key":"1211_CR37","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ipm.2009.12.007","volume":"46","author":"J Yoo","year":"2010","unstructured":"Yoo J, Choi S (2010) Orthogonal nonnegative matrix tri-factorization for co-clustering: multiplicative updates on stiefel manifolds. Inf Process Manag 46(5):559\u2013570. https:\/\/doi.org\/10.1016\/j.ipm.2009.12.007","journal-title":"Inf Process Manag"},{"key":"1211_CR38","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/J.AIOPEN.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Hu S et al (2020) Graph neural networks: a review of methods and applications. AI Open 1:57\u201381. https:\/\/doi.org\/10.1016\/J.AIOPEN.2021.01.001","journal-title":"AI Open"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01211-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-026-01211-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-026-01211-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T05:53:12Z","timestamp":1783576392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-026-01211-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,9]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1211"],"URL":"https:\/\/doi.org\/10.1007\/s10618-026-01211-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,9]]},"assertion":[{"value":"27 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"M. Plantevit, R.G. Pensa, and C. Robardet are members of the Editorial Board. The authors have no further conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare that this research did not require Ethics approval or Consent to participate since it does not concern human participants or human or animal datasets.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The authors of this manuscript consent to its publication.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"48"}}