{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T20:42:00Z","timestamp":1773520920939,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T00:00:00Z","timestamp":1623369600000},"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":["Mach Learn"],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The majority of the data produced by human activities and modern cyber-physical systems involve complex relations among their features. Such relations can be often represented by means of tensors, which can be viewed as generalization of matrices and, as such, can be analyzed by using higher-order extensions of existing machine learning methods, such as clustering and co-clustering. Tensor co-clustering, in particular, has been proven useful in many applications, due to its ability of coping with <jats:italic>n<\/jats:italic>-modal data and sparsity. However, setting up a co-clustering algorithm properly requires the specification of the desired number of clusters for each mode as input parameters. This choice is already difficult in relatively easy settings, like flat clustering on data matrices, but on tensors it could be even more frustrating. To face this issue, we propose a new tensor co-clustering algorithm that does not require the number of desired co-clusters as input, as it optimizes an objective function based on a measure of association across discrete random variables (called Goodman and Kruskal\u2019s <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\tau$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c4<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>) that is not affected by their cardinality. We introduce different optimization schemes and show their theoretical and empirical convergence properties. Additionally, we show the effectiveness of our algorithm on both synthetic and real-world datasets, also in comparison with state-of-the-art co-clustering methods based on tensor factorization and latent block models.<\/jats:p>","DOI":"10.1007\/s10994-021-06002-w","type":"journal-article","created":{"date-parts":[[2021,6,11]],"date-time":"2021-06-11T17:02:57Z","timestamp":1623430977000},"page":"385-427","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A parameter-less algorithm for tensor co-clustering"],"prefix":"10.1007","volume":"112","author":[{"given":"Elena","family":"Battaglia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5145-3438","authenticated-orcid":false,"given":"Ruggero G.","family":"Pensa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,11]]},"reference":[{"key":"6002_CR1","doi-asserted-by":"crossref","unstructured":"Araujo, M., Ribeiro, P. M. P., & Faloutsos, C. (2018). Tensorcast: Forecasting time-evolving networks with contextual information. Proceedings of IJCAI, 2018, 5199\u20135203.","DOI":"10.24963\/ijcai.2018\/721"},{"key":"6002_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee, A., Basu, S., & Merugu, S. (2007). Multi-way clustering on relation graphs. Proceedings of SIAM SDM, 2007, 145\u2013156.","DOI":"10.1137\/1.9781611972771.14"},{"key":"6002_CR39","first-page":"205","volume-title":"Proceedings of Discovery Science 2019<br>","author":"Battaglia Elena","year":"2019","unstructured":"Battaglia, E. & Pensa, R. G. (2019). Parameter-Less Tensor Co-clustering. In: Proceedings of Discovery Sciences 2019, pp 205-219. Springer"},{"key":"6002_CR3","doi-asserted-by":"crossref","unstructured":"Boutalbi, R., Labiod, L., Nadif, M. (2019a). Co-clustering from tensor data. In: Advances in Knowledge Discovery and Data Mining - 23rd Pacific-Asia Conference, PAKDD 2019, Macau, China, April 14-17, 2019, Proceedings, Part I, Springer, Lecture Notes in Computer Science, vol 11439, pp 370\u2013383.","DOI":"10.1007\/978-3-030-16148-4_29"},{"key":"6002_CR4","doi-asserted-by":"crossref","unstructured":"Boutalbi, R., Labiod, L., Nadif, M. (2019b). Sparse tensor co-clustering as a tool for document categorization. In: Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2019, Paris, France, July 21-25, 2019, ACM, pp 1157\u20131160.","DOI":"10.1145\/3331184.3331360"},{"key":"6002_CR5","doi-asserted-by":"crossref","unstructured":"Cantador, I., Brusilovsky, P., Kuflik, T., & (2011) 2nd workshop on information heterogeneity and fusion in recommender systems (hetrec, . (2011). In: Proceedings of the 5th ACM conference on Recommender systems (p. 2011). New York, NY, USA, RecSys: ACM.","DOI":"10.1145\/2043932.2044016"},{"issue":"11","key":"6002_CR6","doi-asserted-by":"publisher","first-page":"2546","DOI":"10.1109\/TCYB.2014.2376938","volume":"45","author":"X Cao","year":"2015","unstructured":"Cao, X., Wei, X., Han, Y., & Lin, D. (2015). Robust face clustering via tensor decomposition. IEEE Trans Cybernetics, 45(11), 2546\u20132557.","journal-title":"IEEE Trans Cybernetics"},{"issue":"1","key":"6002_CR7","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/1497577.1497580","volume":"3","author":"L Cerf","year":"2009","unstructured":"Cerf, L., Besson, J., Robardet, C., & Boulicaut, J. (2009). Closed patterns meet n-ary relations. TKDD, 3(1), 3:1-3:36.","journal-title":"TKDD"},{"issue":"3","key":"6002_CR8","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/s10618-012-0284-8","volume":"26","author":"L Cerf","year":"2013","unstructured":"Cerf, L., Besson, J., Nguyen, K., & Boulicaut, J. (2013). Closed and noise-tolerant patterns in n-ary relations. Data Mining and Knowledge Discovery, 26(3), 574\u2013619.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6002_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Papadimitriou, S., Modha, D. S., & Faloutsos, C. (2004). Fully automatic cross-associations. Proceedings of ACM SIGKDD, 2004, 79\u201388.","DOI":"10.1145\/1014052.1014064"},{"key":"6002_CR10","doi-asserted-by":"crossref","unstructured":"Cho, H., Dhillon, I. S., Guan, Y., & Sra, S. (2004). Minimum sum-squared residue co-clustering of gene expression data. Proceedings of SIAM SDM, 2004, 114\u2013125.","DOI":"10.1137\/1.9781611972740.11"},{"key":"6002_CR11","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research, 7, 1\u201330.","journal-title":"The Journal of Machine Learning Research"},{"key":"6002_CR12","doi-asserted-by":"crossref","unstructured":"Dhillon, I. S., Mallela, S., & Modha, D. S. (2003). Information-theoretic co-clustering. Proceedings of ACM SIGKDD, 2003, 89\u201398.","DOI":"10.1145\/956750.956764"},{"key":"6002_CR13","doi-asserted-by":"crossref","unstructured":"Ding, C. H. Q., Li, T., Peng, W., & Park, H. (2006). Orthogonal nonnegative matrix t-factorizations for clustering. Proceedings of ACM SIGKDD, 2006, 126\u2013135.","DOI":"10.1145\/1150402.1150420"},{"issue":"1","key":"6002_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10618-013-0341-y","volume":"29","author":"B Ermis","year":"2015","unstructured":"Ermis, B., Acar, E., & Cemgil, A. T. (2015). Link prediction in heterogeneous data via generalized coupled tensor factorization. Data Mining and Knowledge Discovery, 29(1), 203\u2013236.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6002_CR15","first-page":"732","volume":"49","author":"LA Goodman","year":"1954","unstructured":"Goodman, L. A., & Kruskal, W. H. (1954). Measures of association for cross classification. Journal of the American Statistical Association, 49, 732\u2013764.","journal-title":"Journal of the American Statistical Association"},{"key":"6002_CR16","unstructured":"Harshman, R.A. (1970). Foundation of the parafac procedure: models and conditions for an\u201c explanatory\u201d multimodal factor analysis. UCLA Working Papers in Phonetics 16:1\u201384."},{"key":"6002_CR17","doi-asserted-by":"crossref","unstructured":"He, J., Li, X., Liao, L., & Wang, M. (2018). Inferring continuous latent preference on transition intervals for next point-of-interest recommendation. Proceesings of ECML PKDD, 2018, 741\u2013756.","DOI":"10.1007\/978-3-030-10928-8_44"},{"key":"6002_CR18","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.ins.2018.03.019","volume":"447","author":"M Hong","year":"2018","unstructured":"Hong, M., & Jung, J. J. (2018). Multi-sided recommendation based on social tensor factorization. Information Sciences, 447, 140\u2013156.","journal-title":"Information Sciences"},{"key":"6002_CR19","doi-asserted-by":"crossref","unstructured":"Huang, H., Ding, C.H.Q., Luo, D., Li, T. (2008). Simultaneous tensor subspace selection and clustering: The equivalence of high order svd and k-means clustering. In: Proceedings of the 14th ACM SIGKDD, pp 327\u2013335.","DOI":"10.1145\/1401890.1401933"},{"issue":"4","key":"6002_CR20","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1504\/IJDMMM.2012.049880","volume":"4","author":"W Huang","year":"2012","unstructured":"Huang, W., Pan, Y., & Wu, J. (2012). Goodman-kruskal measure associated clustering for categorical data. International Journal of Data Mining, Modelling and Management, 4(4), 334\u2013360.","journal-title":"International Journal of Data Mining, Modelling and Management"},{"issue":"1","key":"6002_CR21","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. Journal of Classification, 2(1), 193\u2013218.","journal-title":"Journal of Classification"},{"issue":"2","key":"6002_CR22","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10618-012-0248-z","volume":"26","author":"D Ienco","year":"2013","unstructured":"Ienco, D., Robardet, C., Pensa, R. G., & Meo, R. (2013). Parameter-less co-clustering for star-structured heterogeneous data. Data Mining and Knowledge Discovery, 26(2), 217\u2013254.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"6002_CR23","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T. G., & Bader, B. W. (2009). Tensor decompositions and applications. SIAM Review, 51(3), 455\u2013500.","journal-title":"SIAM Review"},{"key":"6002_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen, K., Cerf, L., Plantevit, M., Boulicaut, J. (2011). Multidimensional association rules in boolean tensors. In: Proceedings of the Eleventh SIAM International Conference on Data Mining, SDM 2011(April), pp. 28\u201330. (2011). Mesa (pp. 570\u2013581). Arizona: USA, SIAM \/ Omnipress.","DOI":"10.1137\/1.9781611972818.49"},{"key":"6002_CR25","doi-asserted-by":"crossref","unstructured":"Papalexakis, E.E., Dogru\u00f6z, A.S. (2015). Understanding multilingual social networks in online immigrant communities. In: Proceedings of MWA 2015 (co-located with WWW 2015), pp 865\u2013870.","DOI":"10.1145\/2740908.2743004"},{"issue":"2","key":"6002_CR26","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/TSP.2012.2225052","volume":"61","author":"EE Papalexakis","year":"2013","unstructured":"Papalexakis, E. E., Sidiropoulos, N. D., & Bro, R. (2013). From K-means to higher-way co-clustering: Multilinear decomposition with sparse latent factors. IEEE Trans Signal Processing, 61(2), 493\u2013506.","journal-title":"IEEE Trans Signal Processing"},{"issue":"1","key":"6002_CR27","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10618-012-0292-8","volume":"28","author":"RG Pensa","year":"2014","unstructured":"Pensa, R. G., Ienco, D., & Meo, R. (2014). Hierarchical co-clustering: off-line and incremental approaches. Data Mining and Knowledge Discovery, 28(1), 31\u201364.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6002_CR28","doi-asserted-by":"crossref","unstructured":"Robardet, C., & Feschet, F. (2001). Efficient local search in conceptual clustering. Proceedings of DS, 2001, 323\u2013335.","DOI":"10.1007\/3-540-45650-3_28"},{"key":"6002_CR29","doi-asserted-by":"crossref","unstructured":"Shashua, A., Hazan, T. (2005). Non-negative tensor factorization with applications to statistics and computer vision. In: Proceedings of (ICML 2005, pp 792\u2013799.","DOI":"10.1145\/1102351.1102451"},{"key":"6002_CR30","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl, A., & Ghosh, J. (2002). Cluster ensembles - A knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583\u2013617.","journal-title":"Journal of Machine Learning Research"},{"key":"6002_CR31","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02289464","volume":"31","author":"LR Tucker","year":"1966","unstructured":"Tucker, L. R. (1966). Some mathematical notes on three-mode factor analysis. Psychometrika, 31, 279\u2013311.","journal-title":"Psychometrika"},{"key":"6002_CR32","unstructured":"Wang, M., & Zeng, Y. (2019). Multiway clustering via tensor block models. Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, 8\u201314 December 2019 (pp. 713\u2013723). BC, Canada: Vancouver."},{"key":"6002_CR33","unstructured":"Wu, T., Benson, A. R., & Gleich, D. F. (2016). General tensor spectral co-clustering for higher-order data. Proceedings of NIPS, 2016, 2559\u20132567."},{"key":"6002_CR34","doi-asserted-by":"publisher","first-page":"18113","DOI":"10.1109\/ACCESS.2019.2894267","volume":"7","author":"K Yu","year":"2019","unstructured":"Yu, K., He, L., Yu, P. S., Zhang, W., & Liu, Y. (2019). Coupled tensor decomposition for user clustering in mobile internet traffic interaction pattern. IEEE Access, 7, 18113\u201318124.","journal-title":"IEEE Access"},{"issue":"2","key":"6002_CR35","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1137\/S0895479899352045","volume":"23","author":"T Zhang","year":"2001","unstructured":"Zhang, T., & Golub, G. H. (2001). Rank-one approximation to high order tensors. SIAM Journal on Matrix Analysis and Applications, 23(2), 534\u2013550.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"6002_CR36","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10115-011-0460-y","volume":"34","author":"Z Zhang","year":"2013","unstructured":"Zhang, Z., Li, T., & Ding, C. H. Q. (2013). Non-negative tri-factor tensor decomposition with applications. Knowledge and Information Systems, 34(2), 243\u2013265.","journal-title":"Knowledge and Information Systems"},{"key":"6002_CR37","doi-asserted-by":"crossref","unstructured":"Zhao, L., Zaki, M.J. (2005). Tricluster: An effective algorithm for mining coherent clusters in 3d microarray data. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, June 14-16, 2005, ACM, pp 694\u2013705.","DOI":"10.1145\/1066157.1066236"},{"key":"6002_CR38","doi-asserted-by":"crossref","unstructured":"Zhou, Q., Xu, G., & Zong, Y. (2009). Web co-clustering of usage network using tensor decomposition. Proceedings of ECBS, 2009, 311\u2013314.","DOI":"10.1109\/WI-IAT.2009.290"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06002-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06002-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06002-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,24]],"date-time":"2023-08-24T07:07:03Z","timestamp":1692860823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06002-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,11]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["6002"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06002-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,11]]},"assertion":[{"value":"28 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}