Unbalanced Incomplete Multi-View Clustering Via the Scheme of View Evolution: Weak Views are Meat; Strong Views Do Eat

被引:44
作者
Fang, Xiang [1 ]
Hu, Yuchong [1 ]
Zhou, Pan [2 ]
Wu, Dapeng Oliver [3 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Key Lab Informat Storage Syst, Minist Educ China, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Hubei Engn Res Ctr Big Data Secur, Sch Cyber Sci & Engn, Wuhan 430074, Peoples R China
[3] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
来源
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE | 2022年 / 6卷 / 04期
基金
中国国家自然科学基金;
关键词
Evolution (biology); Clustering methods; Videos; Statistics; Sociology; Perturbation methods; Laplace equations; Unbalanced incomplete multi-view clustering; weak view; strong view; view evolution;
D O I
10.1109/TETCI.2021.3077909
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Incomplete multi-view clustering is an important technique to deal with real-world incomplete multi-view data. Previous methods assume that all views have the same incompleteness, i.e., balanced incompleteness. However, different views often have distinct incompleteness, i.e., unbalanced incompleteness, which results in strong views (low-incompleteness views) and weak views (high-incompleteness views). The unbalanced incompleteness prevents us from directly using previous methods. In this paper, inspired by the effective biological evolution theory, we design the novel scheme of view evolution to cluster strong and weak views. Moreover, we propose an Unbalanced Incomplete Multi-view Clustering method (UIMC), which is the first effective method based on view evolution for unbalanced incomplete multi-view clustering. Compared with previous methods, UIMC has two unique advantages: 1) it proposes weighted multi-view subspace clustering to integrate unbalanced incomplete views, which effectively solves the unbalanced incomplete multi-view clustering problem; 2) it designs the low-rank representation to recover the data, which diminishes the impact of the incompleteness and noises. Extensive experimental results demonstrate that UIMC improves the clustering performance by up to 40% on three evaluation metrics over other state-of-the-art methods. We provide codes for all of our experiments in https://github.com/ZeusDavide/TETCI_UIMC.
引用
收藏
页码:913 / 927
页数:15
相关论文
共 55 条
[1]  
Blum A., 1998, Proceedings of the Eleventh Annual Conference on Computational Learning Theory, P92, DOI 10.1145/279943.279962
[2]  
Boyd S., 2010, FOUND TRENDS MACH LE, V3, P1, DOI DOI 10.1561/2200000016
[3]   Multi-view low-rank sparse subspace clustering [J].
Brbic, Maria ;
Kopriva, Ivica .
PATTERN RECOGNITION, 2018, 73 :247-258
[4]   Performance-Aware Model for Sparse Matrix-Matrix Multiplication on the Sunway TaihuLight Supercomputer [J].
Chen, Yuedan ;
Li, Kenli ;
Yang, Wangdong ;
Xiao, Guoqing ;
Xie, Xianghui ;
Li, Tao .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (04) :923-938
[5]  
Cui XH, 2016, 2016 THIRD INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND PATTERN RECOGNITION (AIPR)
[6]  
Darwin C, 2009, ON THE ORIGIN OF SPECIES, P1, DOI 10.1017/CBO9780511694295.004
[7]   Multi-view Adversarially Learned Inference for Cross-domain Joint Distribution Matching [J].
Du, Changying ;
Du, Changde ;
Xie, Xingyu ;
Zhang, Chen ;
Wang, Hao .
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, :1348-1357
[8]   Accurate Content Push for Content-Centric Social Networks: A Big Data Support Online Learning Approach [J].
Feng, Yinan ;
Zhou, Pan ;
Wu, Dapeng ;
Hu, Yuchong .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2018, 2 (06) :426-438
[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]  
Gao JY, 2019, AAAI CONF ARTIF INTE, P3622