{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T04:34:41Z","timestamp":1772685281906,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T00:00:00Z","timestamp":1626998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762078"],"award-info":[{"award-number":["61762078"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61363058"],"award-info":[{"award-number":["61363058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762079"],"award-info":[{"award-number":["61762079"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangxi Key Laboratory of Trusted Software","award":["kx201910"],"award-info":[{"award-number":["kx201910"]}]},{"name":"Research Fund of Guangxi Key Lab of Multi-source Information Mining & Security","award":["MIMS18-08"],"award-info":[{"award-number":["MIMS18-08"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s13042-021-01375-9","type":"journal-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T17:03:00Z","timestamp":1627059780000},"page":"2887-2898","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hierarchical high-order co-clustering algorithm by maximizing modularity"],"prefix":"10.1007","volume":"12","author":[{"given":"Jiahui","family":"Wei","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5104-8982","authenticated-orcid":false,"given":"Huifang","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Yuhang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhixin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"1375_CR1","doi-asserted-by":"crossref","unstructured":"Ailem M, Role F, Nadif M Co-clustering document-term matrices by direct maximization of graph modularity. In: Proc. 24th ACM Int. Conf. Inf. Knowl. Manage, 2015 pp 1807\u20131s810.","DOI":"10.1145\/2806416.2806639"},{"key":"1375_CR2","doi-asserted-by":"crossref","unstructured":"Wang Y, Feng C, Guo C, Chu Y, Hwang J (2019) Solving the sparsity problem in recommendations via cross-domain item embedding based on co-clustering. In: Proc. 12th ACM Int. Conf. Web Search Data Mining, 717\u2013725.","DOI":"10.1145\/3289600.3290973"},{"key":"1375_CR3","doi-asserted-by":"crossref","unstructured":"Feng L, Zhao Q, Zhou C (2020) Improving performances of Top-N recommendations with co-clustering method, Expert Syst. Appl., 143.","DOI":"10.1016\/j.eswa.2019.113078"},{"issue":"2","key":"1375_CR4","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TCBB.2017.2705686","volume":"16","author":"X Chen","year":"2019","unstructured":"Chen X, Huang JZ, Wu Q, Yang M (2019) Subspace weighting co-clustering of gene expression data. IEEE\/ACM Trans Comput Biol Bioinform 16(2):352\u2013364","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"1375_CR5","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.asoc.2018.07.045","volume":"72","author":"SF Hussain","year":"2018","unstructured":"Hussain SF, Iqbal S (2018) CCGA: Co-similarity based Co-clustering using genetic algorithm. Appl Soft Comput 72:30\u201342","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1375_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/TPAMI.2018.2876253","volume":"42","author":"M Keuper","year":"2020","unstructured":"Keuper M, Tang S, Andres B, Brox T, Schiele B (2020) Motion segmentation & multiple object tracking by correlation co-clustering. IEEE Trans Pattern Anal Mach Intell 42(1):140\u2013153","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"9","key":"1375_CR7","doi-asserted-by":"publisher","first-page":"2293","DOI":"10.1109\/TKDE.2013.47","volume":"26","author":"L Meng","year":"2014","unstructured":"Meng L, Tan A, Xu D (2014) Semi-supervised heterogeneous fusion for multimedia data co-clustering. IEEE Trans Knowl Data Eng 26(9):2293\u20132306","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1375_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10115-015-0823-x","volume":"46","author":"W Cheng","year":"2016","unstructured":"Cheng W, Zhang X, Pan F, Wang W (2016) HICC: an entropy splitting-based framework for hierarchical co-clustering. Knowl Inf Syst 46(2):343\u2013367","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1375_CR9","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 RG, Meo R (2013) Parameter-less co-clustering for star-structured heterogeneous data. Data Min Knowl Discov 26(2):217\u2013254","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"1375_CR10","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TNNLS.2018.2851444","volume":"30","author":"M Yin","year":"2019","unstructured":"Yin M, Gao J, Xie S, Guo Y (2019) Multiview subspace clustering via tensorial t-product representation. IEEE Trans Neural Netw Learning Syst 30(3):851\u2013864","journal-title":"IEEE Trans Neural Netw Learning Syst"},{"key":"1375_CR11","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.patcog.2018.09.016","volume":"86","author":"L Huang","year":"2019","unstructured":"Huang L, Chao H, Wang C (2019) Multi-view intact space clustering. Pattern Recogn 86:344\u2013353","journal-title":"Pattern Recogn"},{"key":"1375_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2019.09.079","volume":"512","author":"M Yin","year":"2020","unstructured":"Yin M, Gao J, Xie S, Guo Y (2020) Auto-weighted multi-view co-clustering with bipartite graphs. Inf Sci 512:18\u201330","journal-title":"Inf Sci"},{"key":"1375_CR13","doi-asserted-by":"crossref","unstructured":"Gao B, Liu T, Zheng X, Cheng Q, Ma W (2005) Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering. In: Proc. 11th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp 41\u201350.","DOI":"10.1145\/1081870.1081879"},{"key":"1375_CR14","doi-asserted-by":"crossref","unstructured":"Gao B, Liu T, Ma W (2006) Star-structured high-order heterogeneous data co-clustering based on consistent information theory, In: Proc. 6th ACM Int. Conf. Data Mining, pp 880\u2013884.","DOI":"10.1109\/ICDM.2006.154"},{"issue":"10","key":"1375_CR15","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TKDE.2009.169","volume":"22","author":"Y Chen","year":"2009","unstructured":"Chen Y, Wang L, Dong M (2009) Non-negative matrix factorization for semi-supervised heterogeneous data co-clustering. IEEE Trans Knowl Data Eng 22(10):1459\u20131474","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1375_CR16","doi-asserted-by":"crossref","unstructured":"Wang S, Guo W (2017) Robust co-clustering via dual local learning and high-order matrix factorization, Knowl.-Based Syst., 138:176\u201317.","DOI":"10.1016\/j.knosys.2017.09.033"},{"key":"1375_CR17","doi-asserted-by":"crossref","unstructured":"Xu D, Cheng W, Zong B, Ni J, Song D, Yu W, Chen Y, Chen H, Zhang X (2019) Deep Co-Clustering. In: Proc. SIAM Int. Conf. Data Mining, pp 414\u2013422.","DOI":"10.1137\/1.9781611975673.47"},{"issue":"2","key":"1375_CR18","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/TSP.2012.2225052","volume":"61","author":"EE Papalexakis","year":"2013","unstructured":"Papalexakis EE, Sidiropoulos ND, 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"},{"key":"1375_CR19","doi-asserted-by":"crossref","unstructured":"Dhillon IS (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proc. 7th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp 269\u2013274.","DOI":"10.1145\/502512.502550"},{"key":"1375_CR20","doi-asserted-by":"crossref","unstructured":"Li T (2005) A general model for clustering binary data, In: Proc. 11th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp 188\u2013197.","DOI":"10.1145\/1081870.1081894"},{"key":"1375_CR21","doi-asserted-by":"crossref","unstructured":"Labiod L, Nadif M (2011) Co-clustering for binary and categorical data with maximum modularity. In: Proc. 11th ACM Int. Conf. Data Mining, pp 1040\u20131045.","DOI":"10.1109\/ICDM.2011.37"},{"issue":"1","key":"1375_CR22","doi-asserted-by":"publisher","first-page":"441","DOI":"10.3233\/JIFS-179418","volume":"38","author":"H Han","year":"2020","unstructured":"Han H, Dong X, Zuo C (2020) A weighted recommendation algorithm based on multiview clustering of user. J Intell Fuzzy Syst 38(1):441\u2013451","journal-title":"J Intell Fuzzy Syst"},{"key":"1375_CR23","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.patcog.2017.06.012","volume":"75","author":"J Li","year":"2018","unstructured":"Li J, Wang C, Li P, Lai J (2018) Discriminative metric learning for multi-view graph partitioning. Pattern Recogn 75:199\u2013213","journal-title":"Pattern Recogn"},{"key":"1375_CR24","doi-asserted-by":"crossref","unstructured":"Kim Y, Amini M, Goutte C, Gallinari P (2010) Multi-view clustering of multilingual documents, In: Proc. Int. ACM SIGIR Conf. Res. Develop. Inf. Retr., pp 821\u2013822.","DOI":"10.1145\/1835449.1835633"},{"issue":"8","key":"1375_CR25","doi-asserted-by":"publisher","first-page":"10761","DOI":"10.1007\/s11042-015-3173-5","volume":"76","author":"M Zhang","year":"2017","unstructured":"Zhang M, Yang Y, Shen F, Zhang H, Wang Y (2017) Multi-view feature selection and classification for Alzheimer\u2019s disease diagnosis. Multimedia Tools Appl 76(8):10761\u201310775","journal-title":"Multimedia Tools Appl"},{"issue":"5","key":"1375_CR26","doi-asserted-by":"publisher","first-page":"1826","DOI":"10.1109\/TCYB.2018.2815012","volume":"49","author":"K Zhan","year":"2019","unstructured":"Zhan K, Chang X, Guan J, Chen L, Ma Z, Yang Y (2019) Adaptive structure discovery for multimedia analysis using multiple features. IEEE Trans Cybernetics 49(5):1826\u20131834","journal-title":"IEEE Trans Cybernetics"},{"issue":"7","key":"1375_CR27","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1109\/TKDE.2005.147","volume":"19","author":"B Gao","year":"2005","unstructured":"Gao B, Liu T, Feng G, Qin T, Cheng Q, Ma W (2005) Hierarchical taxonomy preparation for text categorization using consistent bipartite spectral graph co-partitioning. IEEE Trans Knowl Data Eng 19(7):1263\u20131273","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"12","key":"1375_CR28","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1109\/TKDE.2009.207","volume":"22","author":"G Greco","year":"2010","unstructured":"Greco G, Guzzo A, Pontieri L (2010) Coclustering multiple heterogeneous domains: linear combinations and agreements. IEEE Trans Knowl Data Eng 22(12):1649\u20131663","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1375_CR29","doi-asserted-by":"crossref","unstructured":"Sun Y, Yu Y, Han J (2009) Ranking-based clustering of heterogeneous information networks with star network schema, In: Proc. 15th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp 797\u2013806.","DOI":"10.1145\/1557019.1557107"},{"issue":"8","key":"1375_CR30","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/34.85677","volume":"13","author":"XL Xie","year":"1991","unstructured":"Xie XL, Beni G (1991) A validity measure for fuzzy clustering. IEEE Trans Pattern Anal Mach Intell 13(8):841\u2013847","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"10","key":"1375_CR31","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TKDE.2009.169","volume":"22","author":"Y Chen","year":"2010","unstructured":"Chen Y, Wang L, Dong M (2010) Non-negative matrix factorization for semi-supervised heterogeneous data co-clustering. IEEE Trans Knowl Data Eng 22(10):1459\u20131474","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1375_CR32","doi-asserted-by":"crossref","unstructured":"Cohen-Addad V, Kanade V, Mallmann-Trenn F, Mathieu C (2019) Hierarchical clustering: objective functions and algorithms, J ACM 66(4):26:1\u201326:42.","DOI":"10.1145\/3321386"},{"key":"1375_CR33","doi-asserted-by":"crossref","unstructured":"Charikar M, Chatziafratis V, Niazadeh R (2019) Hierarchical clustering better than average-linkage. In: Proc. 15th ACM-SIAM Symp. on Dis. Algor., pp 2291\u20132304.","DOI":"10.1137\/1.9781611975482.139"},{"key":"1375_CR34","doi-asserted-by":"publisher","first-page":"106990","DOI":"10.1016\/j.asoc.2020.106990","volume":"100","author":"LR Emmendorfer","year":"2021","unstructured":"Emmendorfer LR, Canuto AM (2021) A generalized average linkage criterion for hierarchical agglomerative clustering. Appl Soft Comput 100:106990","journal-title":"Appl Soft Comput"},{"key":"1375_CR35","doi-asserted-by":"crossref","unstructured":"Shi P, Zhao Z, Zhong H, Zhong H, Shen H, Ding L (2021) An improved agglomerative hierarchical clustering anomaly detection method for scientific data. Concurrency and computation, Practice and Experience, 33(6):e6077","DOI":"10.1002\/cpe.6077"},{"key":"1375_CR36","first-page":"10532","volume":"5","author":"I Diez","year":"2015","unstructured":"Diez I, Bonifazi P, Escudero I, Mateos B, Mu\u00f1oz MA, Stramaglia S, Cortes JM (2015) A novel brain partition highlights the modular skeleton shared by structure and function. Sci Reports 5:10532","journal-title":"Sci Reports"},{"issue":"5","key":"1375_CR37","doi-asserted-by":"publisher","first-page":"522","DOI":"10.3390\/e23050522","volume":"23","author":"M Hu","year":"2021","unstructured":"Hu M, Zeng K, Wang Y et al (2021) Threshold-based hierarchical clustering for person re-identification. Entropy 23(5):522","journal-title":"Entropy"},{"key":"1375_CR38","doi-asserted-by":"crossref","unstructured":"Dhillon IS, Mallela S, Modha DS (2003) Information-theoretic co-clustering, In: Proc. 9th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, pp 89\u201398.","DOI":"10.1145\/956750.956764"},{"key":"1375_CR39","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.patcog.2017.12.005","volume":"77","author":"Q Tan","year":"2018","unstructured":"Tan Q, Yang P, He J (2018) Feature co-shrinking for co-clustering. Pattern Recogn 77:12\u201319","journal-title":"Pattern Recogn"},{"key":"1375_CR40","doi-asserted-by":"crossref","unstructured":"Wang H, Nie F, Huang H, Ding CHQ (2011) Nonnegative matrix tri-factorization based high-order co-clustering and its fast implementation. In: Proc. 11th ACM Int. Conf. Data Mining, 2011, pp 774\u2013783.","DOI":"10.1109\/ICDM.2011.109"},{"key":"1375_CR41","doi-asserted-by":"crossref","unstructured":"Slonim N, Tishby N (2000) Document clustering using word clusters via the information bottleneck method, In: Proc. 23rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retr., pp 208\u2013215.","DOI":"10.1145\/345508.345578"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-021-01375-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-021-01375-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-021-01375-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T05:14:49Z","timestamp":1629609289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-021-01375-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,23]]},"references-count":41,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1375"],"URL":"https:\/\/doi.org\/10.1007\/s13042-021-01375-9","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,23]]},"assertion":[{"value":"28 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No conflicts of interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}