Deep multiple non-negative matrix factorization for multi-view clustering

被引:9
作者
Du, Guowang [1 ]
Zhou, Lihua [1 ]
Lu, Kevin [2 ]
Ding, Haiyan [1 ]
机构
[1] Yunnan Univ, Sch Informat, Kunming 650091, Yunnan, Peoples R China
[2] Brunel Univ, Uxbridge, Middx, England
基金
中国国家自然科学基金;
关键词
Deep non-negative matrix factorization; multi-view clustering; deep AutoEncoder; graph regularization constraints;
D O I
10.3233/IDA-195075
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-view clustering aims to group similar samples into the same clusters and dissimilar samples into different clusters by integrating heterogeneous information from multi-view data. Non-negative matrix factorization (NMF) has been widely applied to multi-view clustering owing to its interpretability. However, most NMF-based algorithms only factorize multi-view data based on the shallow structure, neglecting complex hierarchical and heterogeneous information in multi-view data. In this paper, we propose a deep multiple non-negative matrix factorization (DMNMF) framework based on AutoEncoder for multi-view clustering. DMNMF consists of multiple Encoder Components and Decoder Components with deep structures. Each pair of Encoder Component and Decoder Component are used to hierarchically factorize the input data from a view for capturing the hierarchical information, and all Encoder and Decoder Components are integrated into an abstract level to learn a common low-dimensional representation for combining the heterogeneous information across multi-view data. Furthermore, graph regularizers are also introduced to preserve the local geometric information of each view. To optimize the proposed framework, an iterative updating scheme is developed. Besides, the corresponding algorithm called MVC-DMNMF is also proposed and implemented. Extensive experiments on six benchmark datasets have been conducted, and the experimental results demonstrate the superior performance of our proposed MVC-DMNMF for multi-view clustering compared to other baseline algorithms.
引用
收藏
页码:339 / 357
页数:19
相关论文
共 31 条
[1]  
[Anonymous], 2003, P 26 ANN INT ACM SIG
[2]  
Blum A., 1998, Proceedings of the Eleventh Annual Conference on Computational Learning Theory, P92, DOI 10.1145/279943.279962
[3]  
Boyd S., 2009, Convex Optimization, DOI DOI 10.1017/CBO9780511804441
[4]   Graph Regularized Nonnegative Matrix Factorization for Data Representation [J].
Cai, Deng ;
He, Xiaofei ;
Han, Jiawei ;
Huang, Thomas S. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (08) :1548-1560
[5]   Multi-kernel maximum entropy discrimination for multi-view learning [J].
Chao, Guoqing ;
Sun, Shiliang .
INTELLIGENT DATA ANALYSIS, 2016, 20 (03) :481-493
[6]  
Chaudhuri K., 2009, P 26 ANN INT C MACHI, P129
[7]   A Multimodal Anomaly Detector for Robot-Assisted Feeding Using an LSTM-Based Variational Autoencoder [J].
Park, Daehyung ;
Hoshi, Yuuna ;
Kemp, Charles C. .
IEEE Robotics and Automation Letters, 2018, 3 (03) :1544-1551
[8]   Multi-view deep unsupervised transfer leaning via joint auto-encoder coupled with dictionary learning [J].
Diasse, Abdoullahi ;
Li, Zhiyong .
INTELLIGENT DATA ANALYSIS, 2019, 23 (03) :555-571
[9]  
Gao HC, 2018, PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, P3364
[10]   A fast learning algorithm for deep belief nets [J].
Hinton, Geoffrey E. ;
Osindero, Simon ;
Teh, Yee-Whye .
NEURAL COMPUTATION, 2006, 18 (07) :1527-1554