Multi-View Subspace Clustering via Structured Multi-Pathway Network

被引:25
作者
Wang, Qianqian [1 ,2 ]
Tao, Zhiqiang [3 ]
Gao, Quanxue [4 ]
Jiao, Licheng [5 ]
机构
[1] Xidian Univ, State Key Lab Integrated Serv Networks, Key Lab, Minist Educ Intelligence & Image Understanding, Xian 710071, Peoples R China
[2] Xidian Univ, Sch Telecommun Engn, Xian 710071, Peoples R China
[3] Rochester Inst Technol, Golisano Coll Comp & Informat Sci, Sch Informat, Rochester, NY 14623 USA
[4] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China
[5] Xidian Univ, Sch Artificial Intelligence, Key Lab, Minist Educ Intelligence & Image Understanding, Xian 710071, Peoples R China
基金
中国国家自然科学基金;
关键词
Clustering structure; low-rank constraint; multipath network; multi-view clustering (MVC); PREDICTION;
D O I
10.1109/TNNLS.2022.3213374
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, deep multi-view clustering (MVC) has attracted increasing attention in multi-view learning owing to its promising performance. However, most existing deep multi-view methods use single-pathway neural networks to extract features of each view, which cannot explore comprehensive complementary information and multilevel features. To tackle this problem, we propose a deep structured multi-pathway network (SMpNet) for multi-view subspace clustering task in this brief. The proposed SMpNet leverages structured multi-pathway convolutional neural networks to explicitly learn the subspace representations of each view in a layer-wise way. By this means, both low-level and high-level structured features are integrated through a common connection matrix to explore the comprehensive complementary structure among multiple views. Moreover, we impose a low-rank constraint on the connection matrix to decrease the impact of noise and further highlight the consensus information of all the views. Experimental results on five public datasets show the effectiveness of the proposed SMpNet compared with several state-of-the-art deep MVC methods.
引用
收藏
页码:7244 / 7250
页数:7
相关论文
共 29 条
[1]   Interaction-Aware Graph Neural Networks for Fault Diagnosis of Complex Industrial Processes [J].
Chen, Dongyue ;
Liu, Ruonan ;
Hu, Qinghua ;
Ding, Steven X. .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (09) :6015-6028
[2]  
Chua K, 2018, ADV NEUR IN, V31
[3]   Hybrid method for remaining useful life prediction in wind turbine systems [J].
Djeziri, M. A. ;
Benmoussa, S. ;
Sanchez, R. .
RENEWABLE ENERGY, 2018, 116 :173-187
[4]   Advances in PHM Application Frameworks: Processing Methods, Prognosis Models, Decision Making [J].
Guillen, Antonio J. ;
Gomez, Juan F. ;
Crespo, Adolfo ;
Guerrerro, Alejandro ;
Sola, Antonio ;
Barbera, Luis .
2013 PROGNOSTICS AND HEALTH MANAGEMENT CONFERENCE (PHM), 2013, 33 :391-396
[5]   Fault Diagnosis of Hydraulic Systems Based on Deep Learning Model With Multirate Data Samples [J].
Huang, Keke ;
Wu, Shujie ;
Li, Fanbiao ;
Yang, Chunhua ;
Gui, Weihua .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2022, 33 (11) :6789-6801
[6]   SPECTRAL METHODS IN FLUID-DYNAMICS [J].
HUSSAINI, MY ;
ZANG, TA .
ANNUAL REVIEW OF FLUID MECHANICS, 1987, 19 :339-367
[7]   Physics-informed machine learning [J].
Karniadakis, George Em ;
Kevrekidis, Ioannis G. ;
Lu, Lu ;
Perdikaris, Paris ;
Wang, Sifan ;
Yang, Liu .
NATURE REVIEWS PHYSICS, 2021, 3 (06) :422-440
[8]   Exact indexing of dynamic time warping [J].
Keogh, E ;
Ratanamahatana, CA .
KNOWLEDGE AND INFORMATION SYSTEMS, 2005, 7 (03) :358-386
[9]   A Two-Stage Transfer Adversarial Network for Intelligent Fault Diagnosis of Rotating Machinery With Multiple New Faults [J].
Li, Jipu ;
Huang, Ruyi ;
He, Guolin ;
Liao, Yixiao ;
Wang, Zhen ;
Li, Weihua .
IEEE-ASME TRANSACTIONS ON MECHATRONICS, 2021, 26 (03) :1591-1601
[10]   WaveletKernelNet: An Interpretable Deep Neural Network for Industrial Intelligent Diagnosis [J].
Li, Tianfu ;
Zhao, Zhibin ;
Sun, Chuang ;
Cheng, Li ;
Chen, Xuefeng ;
Yan, Ruqiang ;
Gao, Robert X. .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (04) :2302-2312