Incomplete multi-view clustering network via nonlinear manifold embedding and probability-induced loss

被引:11
作者
Huang, Cheng [1 ]
Cui, Jinrong [1 ,2 ]
Fu, Yulu [1 ]
Huang, Dong [1 ]
Zhao, Min [3 ]
Li, Lusi [4 ]
机构
[1] South China Agr Univ, Coll Math & Informat, Guangzhou 510642, Peoples R China
[2] Guangzhou Key Lab Intelligent Agr, Guangzhou 510642, Peoples R China
[3] Shenzhen Inst Artificial Intelligence & Robot Soc, Shenzhen 518129, Peoples R China
[4] Old Dominion Univ, Dept Comp Sci, Norfolk, VA 23529 USA
关键词
Incomplete multi-view clustering; Deep clustering; Consistent learning; Manifold learning; Gaussian mixture models; MATRIX FACTORIZATION; ALGORITHMS;
D O I
10.1016/j.neunet.2023.03.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Incomplete multi-view clustering, which included missing data in different views, is more challenging than multi-view clustering. For the purpose of eliminating the negative influence of incomplete data, researchers have proposed a series of solutions. However, the present incomplete multi-view clustering methods still confront three major issues: (1) The interference of redundant features hinders these methods to learn the most discriminative features. (2) The importance role of local structure is not considered during clustering. (3) These methods fail to utilize data distribution information to guide models update to decrease the effects of outliers and noise. To address above issues, a novel deep clustering network which exerted on incomplete multi-view data was proposed in this paper. We combine multi-view autoencoders with nonlinear manifold embedding method UMAP to extract latent consistent features of incomplete multi-view data. In the clustering method, we introduce Gaussian Mixture Model (GMM) to fit the complex distribution of data and deal with the interference of outliers. In addition, we reasonably utilize the probability distribution information generated by GMM, using probability-induced loss function to integrate feature learning and clustering as a joint framework. In experiments conducted on multiple benchmark datasets, our method captures incomplete multi-view data features effectively and perform excellent. (c) 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页码:233 / 243
页数:11
相关论文
共 65 条
[1]  
Aggarwal A., 2021, INT J INF MANAG DATA, V1, P100004, DOI [10.1016/j.jjimei.2020.100004, DOI 10.1016/J.JJIMEI.2020.100004]
[2]   A Survey of Handwritten Character Recognition with MNIST and EMNIST [J].
Baldominos, Alejandro ;
Saez, Yago ;
Isasi, Pedro .
APPLIED SCIENCES-BASEL, 2019, 9 (15)
[3]   Joint stage recognition and anatomical annotation of drosophila gene expression patterns [J].
Cai, Xiao ;
Wang, Hua ;
Huang, Heng ;
Ding, Chris .
BIOINFORMATICS, 2012, 28 (12) :I16-I24
[4]  
Chen MS, 2020, AAAI CONF ARTIF INTE, V34, P3513
[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]   Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview [J].
Chi, Yuejie ;
Lu, Yue M. ;
Chen, Yuxin .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2019, 67 (20) :5239-5269
[7]   EEG-Based Cross-Subject Driver Drowsiness Recognition With an Interpretable Convolutional Neural Network [J].
Cui, Jian ;
Lan, Zirui ;
Sourina, Olga ;
Muller-Wittig, Wolfgang .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (10) :7921-7933
[8]  
Damrich S., 2021, Adv. Neural Inf. Process. Syst, V34, P5798, DOI DOI 10.5555/3540261.3540704
[9]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[10]  
Fang Xiang, 2020, IEEE Trans Artif Intell, V1, P233, DOI 10.1109/TAI.2021.3052425