Tensor Learning Meets Dynamic Anchor Learning: From Complete to Incomplete Multiview Clustering

被引:10
作者
Chen, Yongyong [1 ]
Zhao, Xiaojia [2 ]
Zhang, Zheng [2 ]
Liu, Youfa [3 ]
Su, Jingyong [2 ]
Zhou, Yicong [4 ]
机构
[1] Harbin Inst Technol, Guangdong Prov Key Lab Novel Secur Intelligence T, Shenzhen 518055, Peoples R China
[2] Harbin Inst Technol, Sch Comp Sci & Technol, Shenzhen 518055, Peoples R China
[3] Huazhong Agr Univ, Coll Informat, Wuhan 430070, Peoples R China
[4] Univ Macau, Dept Comp & Informat Sci, Macau, Peoples R China
基金
中国国家自然科学基金;
关键词
Tensors; Task analysis; Correlation; Bipartite graph; Excavation; Optimization; Kernel; Bipartite graph learning (BGL); incomplete multiview clustering (IMVC); low-rank tensor learning; multiview clustering (MVC); LOW-RANK; SELF-REPRESENTATION;
D O I
10.1109/TNNLS.2023.3286430
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multiview clustering (MVC), which can dexterously uncover the underlying intrinsic clustering structures of the data, has been particularly attractive in recent years. However, previous methods are designed for either complete or incomplete multiview only, without a unified framework that handles both tasks simultaneously. To address this issue, we propose a unified framework to efficiently tackle both tasks in approximately linear complexity, which integrates tensor learning to explore the inter-view low-rankness and dynamic anchor learning to explore the intra-view low-rankness for scalable clustering (TDASC). Specifically, TDASC efficiently learns smaller view-specific graphs by anchor learning, which not only explores the diversity embedded in multiview data, but also yields approximately linear complexity. Meanwhile, unlike most current approaches that only focus on pair-wise relationships, the proposed TDASC incorporates multiple graphs into an inter-view low-rank tensor, which elegantly models the high-order correlations across views and further guides the anchor learning. Extensive experiments on both complete and incomplete multiview datasets clearly demonstrate the effectiveness and efficiency of TDASC compared with several state-of-the-art techniques.
引用
收藏
页码:15332 / 15345
页数:14
相关论文
共 58 条
[1]   Multi-view low-rank sparse subspace clustering [J].
Brbic, Maria ;
Kopriva, Ivica .
PATTERN RECOGNITION, 2018, 73 :247-258
[2]  
Cai X., 2013, P 23 INT JOINT C ART, DOI [10.5555/2540128.2540503, DOI 10.5555/2540128.2540503]
[3]   ANALYSIS OF INDIVIDUAL DIFFERENCES IN MULTIDIMENSIONAL SCALING VIA AN N-WAY GENERALIZATION OF ECKART-YOUNG DECOMPOSITION [J].
CARROLL, JD ;
CHANG, JJ .
PSYCHOMETRIKA, 1970, 35 (03) :283-&
[4]   Low-Rank Tensor Graph Learning for Multi-View Subspace Clustering [J].
Chen, Yongyong ;
Xiao, Xiaolin ;
Peng, Chong ;
Lu, Guangming ;
Zhou, Yicong .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, 2022, 32 (01) :92-104
[5]   Adaptive Transition Probability Matrix Learning for Multiview Spectral Clustering [J].
Chen, Yongyong ;
Xiao, Xiaolin ;
Hua, Zhongyun ;
Zhou, Yicong .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (09) :4712-4726
[6]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[7]  
Fang Xiang, 2020, IEEE Trans Artif Intell, V1, P233, DOI 10.1109/TAI.2021.3052425
[8]   Spectral grouping using the Nystrom method [J].
Fowlkes, C ;
Belongie, S ;
Chung, F ;
Malik, J .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (02) :214-225
[9]   Multi-View Subspace Clustering [J].
Gao, Hongchang ;
Nie, Feiping ;
Li, Xuelong ;
Huang, Heng .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :4238-4246
[10]   Multiple Kernel Learning Based Multi-view Spectral Clustering [J].
Guo, Dongyan ;
Zhang, Jian ;
Liu, Xinwang ;
Cui, Ying ;
Zhao, Chunxia .
2014 22ND INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2014, :3774-3779