{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T11:20:33Z","timestamp":1770463233017,"version":"3.49.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:00:00Z","timestamp":1670284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T00:00:00Z","timestamp":1670284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"R&D Program of Beijing Municipal Education Commission","award":["KM202011232018"],"award-info":[{"award-number":["KM202011232018"]}]},{"name":"Key Research and Cultivation Project of Scientific Research on Campus of Beijing Information Science and Technology University","award":["2021YJPY236"],"award-info":[{"award-number":["2021YJPY236"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["81903408"],"award-info":[{"award-number":["81903408"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10044-022-01125-9","type":"journal-article","created":{"date-parts":[[2022,12,6]],"date-time":"2022-12-06T08:04:03Z","timestamp":1670313843000},"page":"555-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On improvability of hash clustering data from different sources by bipartite graph"],"prefix":"10.1007","volume":"26","author":[{"given":"Jianxi","family":"Zhao","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0426-0363","authenticated-orcid":false,"given":"Xiaonan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qingrong","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Fangyuan","family":"Kang","sequence":"additional","affiliation":[]},{"given":"Jingfu","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Fan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,6]]},"reference":[{"issue":"2","key":"1125_CR1","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1214\/13-AOS1199","volume":"42","author":"M Soltanolkotabi","year":"2014","unstructured":"Soltanolkotabi M, Elhamifar E, Cand\u00e8s E (2014) Robust subspace clustering. Ann Stat 42(2):669\u2013699","journal-title":"Ann Stat"},{"issue":"2","key":"1125_CR2","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.camwa.2019.07.012","volume":"79","author":"J Zhao","year":"2020","unstructured":"Zhao J, Zhao L (2020) Low-rank and sparse matrices fitting algorithm for low-rank representation. Comput Math Appl 79(2):407\u2013425","journal-title":"Comput Math Appl"},{"issue":"4","key":"1125_CR3","doi-asserted-by":"publisher","first-page":"1676","DOI":"10.1214\/20-AOAS1389","volume":"14","author":"Y Baker","year":"2020","unstructured":"Baker Y, Tang T, Allen G (2020) Feature selection for data integration with mixed multiview data. Ann Appl Stat 14(4):1676\u20131698","journal-title":"Ann Appl Stat"},{"key":"1125_CR4","doi-asserted-by":"crossref","unstructured":"Gao H, Nie F, Li X, et al. (2015) Multi-view subspace clustering. In: Proceedings of the IEEE international conference on computer vision, pp 4238\u20134246","DOI":"10.1109\/ICCV.2015.482"},{"key":"1125_CR5","doi-asserted-by":"crossref","unstructured":"Zhang C, Hu Q, Fu H, et al. (2017) Latent multi-view subspace clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 4279\u20134287","DOI":"10.1109\/CVPR.2017.461"},{"key":"1125_CR6","doi-asserted-by":"crossref","unstructured":"Li R, Zhang C, Fu H, et al. (2019) Reciprocal multi-layer subspace learning for multi-view clustering. In: Proceedings of the IEEE\/CVF international conference on computer vision, pp 8172\u20138180","DOI":"10.1109\/ICCV.2019.00826"},{"issue":"10","key":"1125_CR7","doi-asserted-by":"publisher","first-page":"5147","DOI":"10.1109\/TIP.2019.2913096","volume":"28","author":"Z Yang","year":"2019","unstructured":"Yang Z, Xu Q, Zhang W et al (2019) Split multiplicative multi-view subspace clustering. IEEE Trans Image Process 28(10):5147\u20135160","journal-title":"IEEE Trans Image Process"},{"issue":"1","key":"1125_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1109\/TPAMI.2018.2877660","volume":"42","author":"C Zhang","year":"2018","unstructured":"Zhang C, Fu H, Hu Q et al (2018) Generalized latent multi-view subspace clustering. IEEE Trans Pattern Anal Mach Intell 42(1):86\u201399","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1125_CR9","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/j.ins.2018.10.049","volume":"477","author":"X Zhang","year":"2019","unstructured":"Zhang X, Sun H, Liu Z et al (2019) Robust low-rank kernel multi-view subspace clustering based on the Schatten p-norm and correntropy. Inf Sci 477:430\u2013447","journal-title":"Inf Sci"},{"key":"1125_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.ins.2020.06.068","volume":"544","author":"P Jing","year":"2021","unstructured":"Jing P, Su Y, Li Z et al (2021) Learning robust affinity graph representation for multi-view clustering. Inf Sci 544:155\u2013167","journal-title":"Inf Sci"},{"issue":"4","key":"1125_CR11","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TPAMI.2017.2699960","volume":"40","author":"J Wang","year":"2017","unstructured":"Wang J, Zhang T, Sebe N et al (2017) A survey on learning to hash. IEEE Trans Pattern Anal Mach Intell 40(4):769\u2013790","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1125_CR12","doi-asserted-by":"crossref","unstructured":"Zhang D, Wang F, Si L (2011) Composite hashing with multiple information sources. In: Proceedings of the 34th international ACM SIGIR conference on research and development in information retrieval. pp 225\u2013234","DOI":"10.1145\/2009916.2009950"},{"key":"1125_CR13","doi-asserted-by":"crossref","unstructured":"Shen X, Liu W, Tsang I, et al. (2017) Compressed k-means for large-scale clustering. In: Thirty-First AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v31i1.10852"},{"issue":"7","key":"1125_CR14","doi-asserted-by":"publisher","first-page":"1774","DOI":"10.1109\/TPAMI.2018.2847335","volume":"41","author":"Z Zhang","year":"2019","unstructured":"Zhang Z, Liu L, Shen F et al (2019) Binary multi-view clustering. IEEE Trans Pattern Anal Mach Intell 41(7):1774\u20131782","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1125_CR15","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.neucom.2020.07.132","volume":"427","author":"G Jiang","year":"2021","unstructured":"Jiang G, Wang H, Peng J et al (2021) Graph-based multi-view binary learning for image clustering. Neurocomputing 427:225\u2013237","journal-title":"Neurocomputing"},{"key":"1125_CR16","doi-asserted-by":"crossref","unstructured":"Yang L, Zhang L, Tang Y (2020) Online binary incomplete multi-view clustering. In: Joint European conference on machine learning and knowledge discovery in databases, Springer, Cham, pp 75\u201390","DOI":"10.1007\/978-3-030-67658-2_5"},{"issue":"12","key":"1125_CR17","doi-asserted-by":"publisher","first-page":"2916","DOI":"10.1109\/TPAMI.2012.193","volume":"35","author":"Y Gong","year":"2012","unstructured":"Gong Y, Lazebnik S, Gordo A et al (2012) Iterative quantization: A procrustean approach to learning binary codes for large-scale image retrieval. IEEE Trans Pattern Anal Mach Intell 35(12):2916\u20132929","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"11","key":"1125_CR18","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TPAMI.2013.57","volume":"35","author":"E Elhamifar","year":"2013","unstructured":"Elhamifar E, Vidal R (2013) Sparse subspace clustering: Algorithm, theory, and applications. IEEE Trans Pattern Anal Mach Intell 35(11):2765\u20132781","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1125_CR19","doi-asserted-by":"crossref","unstructured":"Peng X, Zhang L, Yi Z (2013) Scalable sparse subspace clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 430\u2013437","DOI":"10.1109\/CVPR.2013.62"},{"key":"1125_CR20","doi-asserted-by":"crossref","unstructured":"Patel V, Vidal R (2014) Kernel sparse subspace clustering. In: 2014 IEEE international conference on image processing (ICIP). IEEE, pp 2849\u20132853","DOI":"10.1109\/ICIP.2014.7025576"},{"key":"1125_CR21","unstructured":"Li C, Vidal R (2015) Structured sparse subspace clustering: a unified optimization framework. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 277\u2013286"},{"issue":"6","key":"1125_CR22","doi-asserted-by":"publisher","first-page":"2988","DOI":"10.1109\/TIP.2017.2691557","volume":"26","author":"C Li","year":"2017","unstructured":"Li C, You C, Vidal R (2017) Structured sparse subspace clustering: A joint affinity learning and subspace clustering framework. IEEE Trans Image Process 26(6):2988\u20133001","journal-title":"IEEE Trans Image Process"},{"key":"1125_CR23","unstructured":"Yang C, Robinson D, Vidal R (2015) Sparse subspace clustering with missing entries. In: International conference on machine learning, PMLR, pp 2463\u20132472"},{"key":"1125_CR24","doi-asserted-by":"crossref","unstructured":"Chen Y, Li C, You C (2020) Stochastic sparse subspace clustering. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition, pp 4155\u20134164","DOI":"10.1109\/CVPR42600.2020.00421"},{"issue":"4","key":"1125_CR25","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1109\/TCYB.2018.2883566","volume":"50","author":"M Brbi\u0107","year":"2018","unstructured":"Brbi\u0107 M, Kopriva I (2018) L0-motivated low-rank sparse subspace clustering. IEEE Trans Cybern 50(4):1711\u20131725","journal-title":"IEEE Trans Cybern"},{"key":"1125_CR26","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.patcog.2019.06.019","volume":"95","author":"Y Sui","year":"2019","unstructured":"Sui Y, Wang G, Zhang L (2019) Sparse subspace clustering via low-rank structure propagation. Pattern Recogn 95:261\u2013271","journal-title":"Pattern Recogn"},{"key":"1125_CR27","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1109\/LSP.2021.3111812","volume":"28","author":"X Ye","year":"2021","unstructured":"Ye X, Luo S, Zhao J (2021) Deep Bayesian sparse subspace clustering. IEEE Signal Process Lett 28:1888\u20131892","journal-title":"IEEE Signal Process Lett"},{"key":"1125_CR28","doi-asserted-by":"crossref","unstructured":"Zha H, He X, Ding C, et al. (2001) Bipartite graph partitioning and data clustering. In: Proceedings of the tenth international conference on information and knowledge management, pp 25\u201332","DOI":"10.1145\/502585.502591"},{"key":"1125_CR29","doi-asserted-by":"crossref","unstructured":"Li Y, Nie F, Huang H, et al. (2015) Large-scale multi-view spectral clustering via bipartite graph. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9598"},{"key":"1125_CR30","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2019.09.079","volume":"512","author":"S Huang","year":"2020","unstructured":"Huang S, Xu Z, Tsang I et al (2020) Auto-weighted multi-view co-clustering with bipartite graphs. Inf Sci 512:18\u201330","journal-title":"Inf Sci"},{"key":"1125_CR31","doi-asserted-by":"crossref","unstructured":"Li L, He H. (2020) Bipartite graph based multi-view clustering. In: IEEE transactions on knowledge and data engineering","DOI":"10.1109\/TKDE.2020.3021649"},{"key":"1125_CR32","doi-asserted-by":"publisher","first-page":"87952","DOI":"10.1109\/ACCESS.2021.3060135","volume":"9","author":"M Li","year":"2021","unstructured":"Li M, Liang W, Liu X (2021) Multi-view clustering with learned bipartite graph. IEEE Access 9:87952\u201387961","journal-title":"IEEE Access"},{"key":"1125_CR33","doi-asserted-by":"crossref","unstructured":"Lu X, Feng S. (2022) Structure diversity-induced anchor graph fusion for multi-view clustering. In: ACM transactions on knowledge discovery from data (TKDD)","DOI":"10.1145\/3534931"},{"key":"1125_CR34","doi-asserted-by":"crossref","unstructured":"Wang S, Liu X, Liu L, et al. (2022) Highly-efficient incomplete large-scale multi-view clustering with consensus bipartite graph. In: Proceedings of the IEEE conference on computer vision and pattern recognition","DOI":"10.1109\/CVPR52688.2022.00955"},{"key":"1125_CR35","doi-asserted-by":"crossref","unstructured":"Zhao J, Kang F, Zou Q, et al. (2022) Multi-view clustering with orthogonal mapping and binary graph. Expert Syst Appl 118911","DOI":"10.1016\/j.eswa.2022.118911"},{"key":"1125_CR36","doi-asserted-by":"crossref","unstructured":"Hartigan JA, Wong MA (1979) Algorithm AS 136: a k-means clustering algorithm. J R Stat Soc Ser C (Applied Statistics) 28(1): 100\u2013108","DOI":"10.2307\/2346830"},{"issue":"4","key":"1125_CR37","first-page":"4412","volume":"34","author":"Z Kang","year":"2020","unstructured":"Kang Z, Zhou W, Zhao Z et al (2020) Large-scale multi-view subspace clustering in linear time. Proc AAAI Conf Artif Intell 34(4):4412\u20134419","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"3","key":"1125_CR38","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/1007077","volume":"7","author":"G Wahba","year":"1965","unstructured":"Wahba G (1965) A least squares estimate of satellite attitude. SIAM Rev 7(3):409\u2013409","journal-title":"SIAM Rev"},{"issue":"1","key":"1125_CR39","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s11075-018-0630-z","volume":"82","author":"J Zhao","year":"2019","unstructured":"Zhao J, Feng Q, Zhao L (2019) Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization. Numer Algorithms 82(1):371\u2013396","journal-title":"Numer Algorithms"},{"key":"1125_CR40","first-page":"178","volume":"2004","author":"L Fei-Fei","year":"2004","unstructured":"Fei-Fei L, Fergus R, Perona P (2004) Learning generative visual models from few training examples: an incremental Bayesian approach tested on 101 object categories. Conf Comput Vision Pattern Recognit Workshop 2004:178\u2013178","journal-title":"Conf Comput Vision Pattern Recognit Workshop"},{"key":"1125_CR41","first-page":"524","volume":"2005","author":"L Fei-Fei","year":"2005","unstructured":"Fei-Fei L, Perona P (2005) A Bayesian hierarchical model for learning natural scene categories. IEEE Comput Soc Conf Comput Vis Pattern Recognit 2005:524\u2013531","journal-title":"IEEE Comput Soc Conf Comput Vis Pattern Recognit"},{"key":"1125_CR42","doi-asserted-by":"crossref","unstructured":"Chua T, Tang J, Hong R et al. (2009) Nus-wide: a real-world web image database from national university of Singapore. In: Proceedings of the ACM international conference on image and video retrieval, pp 1\u20139","DOI":"10.1145\/1646396.1646452"},{"key":"1125_CR43","doi-asserted-by":"crossref","unstructured":"Brbi\u0107 M, Pi\u0161korec M, Vidulin V et al. (2016) The landscape of microbial phenotypic traits and associated genes. Nucleic Acids Research gkw964","DOI":"10.1093\/nar\/gkw964"},{"issue":"10","key":"1125_CR44","doi-asserted-by":"publisher","first-page":"2887","DOI":"10.1109\/TCYB.2017.2751646","volume":"48","author":"K Zhan","year":"2017","unstructured":"Zhan K, Zhang C, Guan J et al (2017) Graph learning for multiview clustering. IEEE Trans Cybern 48(10):2887\u20132895","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"1125_CR45","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1109\/TKDE.2019.2903810","volume":"32","author":"H Wang","year":"2019","unstructured":"Wang H, Yang Y, Liu B (2019) GMC: Graph-based multi-view clustering. IEEE Trans Knowl Data Eng 32(6):1116\u20131129","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1125_CR46","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1016\/j.knosys.2018.10.022","volume":"163","author":"H Wang","year":"2019","unstructured":"Wang H, Yang Y, Liu B et al (2019) A study of graph-based system for multi-view clustering. Knowl-Based Syst 163:1009\u20131019","journal-title":"Knowl-Based Syst"},{"key":"1125_CR47","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.patcog.2018.09.009","volume":"88","author":"X Wang","year":"2019","unstructured":"Wang X, Lei Z, Guo X et al (2019) Multi-view subspace clustering with intactness-aware similarity. Pattern Recogn 88:50\u201363","journal-title":"Pattern Recogn"},{"key":"1125_CR48","unstructured":"Kumar A, Rai P, Daume H (2011) Co-regularized multi-view spectral clustering. Adv Neural Inf Process Syst 24"},{"key":"1125_CR49","doi-asserted-by":"crossref","unstructured":"Chen P, Liu L, Ma Z et al. (2021) Smoothed multi-view subspace clustering. In: International conference on neural computing for advanced applications, Springer, Singapore, pp 128\u2013140","DOI":"10.1007\/978-981-16-5188-5_10"},{"key":"1125_CR50","doi-asserted-by":"crossref","unstructured":"Kang Z, Lin Z, Zhu X et al. (2021) Structured graph learning for scalable subspace clustering: from single view to multiview. IEEE Transactions on Cybernetics","DOI":"10.1109\/TCYB.2021.3061660"},{"issue":"4","key":"1125_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-022-01871-w","volume":"41","author":"J Zhao","year":"2022","unstructured":"Zhao J (2022) A novel low-rank matrix approximation algorithm for face denoising and background\/foreground separation. Comput Appl Math 41(4):1\u201338","journal-title":"Comput Appl Math"},{"key":"1125_CR52","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105126","volume":"189","author":"G Zhang","year":"2020","unstructured":"Zhang G, Zhou Y, He X et al (2020) One-step kernel multi-view subspace clustering. Knowl-Based Syst 189:105126","journal-title":"Knowl-Based Syst"},{"issue":"5","key":"1125_CR53","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1109\/TCYB.2017.2702343","volume":"48","author":"D Huang","year":"2017","unstructured":"Huang D, Wang C, Lai J (2017) Locally weighted ensemble clustering. IEEE Trans Cybern 48(5):1460\u20131473","journal-title":"IEEE Trans Cybern"},{"key":"1125_CR54","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-022-01125-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-022-01125-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-022-01125-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T15:00:12Z","timestamp":1701529212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-022-01125-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,6]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1125"],"URL":"https:\/\/doi.org\/10.1007\/s10044-022-01125-9","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,6]]},"assertion":[{"value":"16 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}