Incomplete Data Meets Uncoupled Case: A Challenging Task of Multiview Clustering

被引:13
作者
Lin, Jia-Qi [1 ]
Li, Xiang-Long [2 ,3 ,4 ]
Chen, Man-Sheng [2 ,3 ,4 ]
Wang, Chang-Dong [2 ,3 ,4 ]
Zhang, Haizhang [1 ]
机构
[1] Sun Yat Sen Univ, Sch Math Zhuhai, Zhuhai 519082, Peoples R China
[2] Sun Yat Sen Univ, Sch Comp Sci & Engn, Guangzhou 510275, Peoples R China
[3] Minist Educ, Key Lab Machine Intelligence & Adv Comp, Guangzhou 510006, Peoples R China
[4] Guangdong Prov Key Lab Computat Sci, Guangzhou 510006, Peoples R China
关键词
High-order correlation; low-rank tensor approximation; subspace learning; uncoupled incomplete multiview clustering (UIMC); REPRESENTATION;
D O I
10.1109/TNNLS.2022.3224748
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Incomplete multiview clustering (IMC) methods have achieved remarkable progress by exploring the complementary information and consensus representation of incomplete multiview data. However, to our best knowledge, none of the existing methods attempts to handle the uncoupled and incomplete data simultaneously, which affects their generalization ability in real-world scenarios. For uncoupled incomplete data, the unclear and partial cross-view correlation introduces the difficulty to explore the complementary information between views, which results in the unpromising clustering performance for the existing multiview clustering methods. Besides, the presence of hyperparameters limits their applications. To fill these gaps, a novel uncoupled IMC (UIMC) method is proposed in this article. Specifically, UIMC develops a joint framework for feature inferring and recoupling. The high-order correlations of all views are explored by performing a tensor singular value decomposition (t-SVD)-based tensor nuclear norm (TNN) on recoupled and inferred self-representation matrices. Moreover, all hyperparameters of the UIMC method are updated in an exploratory manner. Extensive experiments on six widely used real-world datasets have confirmed the superiority of the proposed method in handling the uncoupled incomplete multiview data compared with the state-of-the-art methods.
引用
收藏
页码:8097 / 8110
页数:14
相关论文
共 71 条
[1]   ALGORITHM - SOLUTION OF MATRIX EQUATION AX+XB = C [J].
BARTELS, RH ;
STEWART, GW .
COMMUNICATIONS OF THE ACM, 1972, 15 (09) :820-&
[2]   Multi-view kernel completion [J].
Bhadra, Sahely ;
Kaski, Samuel ;
Rousu, Juho .
MACHINE LEARNING, 2017, 106 (05) :713-739
[3]   Clustering-Based Denoising With Locally Learned Dictionaries [J].
Chatterjee, Priyam ;
Milanfar, Peyman .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2009, 18 (07) :1438-1451
[4]   Low-Rank Tensor Based Proximity Learning for Multi-View Clustering [J].
Chen, Man-Sheng ;
Wang, Chang-Dong ;
Lai, Jian-Huang .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (05) :5076-5090
[5]   Representation Learning in Multi-view Clustering: A Literature Review [J].
Chen, Man-Sheng ;
Lin, Jia-Qi ;
Li, Xiang-Long ;
Liu, Bao-Yu ;
Wang, Chang-Dong ;
Huang, Dong ;
Lai, Jian-Huang .
DATA SCIENCE AND ENGINEERING, 2022, 7 (03) :225-241
[6]  
Cui B, 2021, 2021 IEEE INT C MULT, P1, DOI DOI 10.1109/TGRS.2021.3062372
[7]   Clustering-Based Spectrum Sharing Strategy for Cognitive Radio Networks [J].
Dai, Jingyi ;
Wang, Shaowei .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2017, 35 (01) :228-237
[8]   Multi-View Clustering With the Cooperation of Visible and Hidden Views [J].
Deng, Zhaohong ;
Liu, Ruixiu ;
Xu, Peng ;
Choi, Kup-Sze ;
Zhang, Wei ;
Tian, Xiaobin ;
Zhang, Te ;
Liang, Ling ;
Qin, Bin ;
Wang, Shitong .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2022, 34 (02) :803-815
[9]   Multi-view subspace learning via bidirectional sparsity [J].
Fan, Ruidong ;
Luo, Tingjin ;
Zhuge, Wenzhang ;
Qiang, Sheng ;
Hou, Chenping .
PATTERN RECOGNITION, 2020, 108
[10]   A Clustering-Based Framework to Control Block Sizes for Entity Resolution [J].
Fisher, Jeffrey ;
Christen, Peter ;
Wang, Qing ;
Rahm, Erhard .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :279-288