Deep low-rank subspace ensemble for multi-view clustering

被引:65
作者
Xue, Zhe [1 ]
Du, Junping [1 ]
Du, Dawei [2 ]
Lyu, Siwei [2 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Comp Sci, Beijing Key Lab Intelligent Telecommun Software, Beijing 100876, Peoples R China
[2] SUNY Albany, Dept Comp Sci, Albany, NY 12222 USA
基金
中国国家自然科学基金;
关键词
Multi-view clustering; Deep matrix factorization; Low-rank subspace; Ensemble learning; RECOGNITION; ALGORITHM; SCALE;
D O I
10.1016/j.ins.2019.01.018
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multi-view clustering aims to incorporate complementary information from different data views for more effective clustering. However, it is difficult to obtain the true categories of data based on complex distribution and diversified latent attributes of multi-view data. In this paper, we propose a new multi-view clustering method that integrates deep matrix factorization, low-rank subspace learning, and multiple subspace ensemble in a unified framework, which we term as the Deep Low-Rank Subspace Ensemble (DLRSE) method. DLRSE first employs deep matrix factorization to capture diverse and hierarchical structures in data for robust multi-view multi-layer data representations. Then, low-rank subspace representations are learned from the extracted factors to further reveal their correlations, from which more explicit clustering structure can be obtained. We further develop a subspace ensemble learning method with structured sparsity regularization to aggregate different subspaces into a consensus subspace, which can incorporate the intrinsic clustering structure across multiple views better. Extensive experiments on several datasets demonstrate that the proposed method can effectively explore the diversified clustering structure inherent in data and exploit multi-view complementary information, and achieve considerable improvement in performance over existing methods. (C) 2019 Published by Elsevier Inc.
引用
收藏
页码:210 / 227
页数:18
相关论文
共 48 条
[1]  
Andrew G., 2013, PMLR, P1247
[2]   Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection [J].
Belhumeur, PN ;
Hespanha, JP ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (07) :711-720
[3]   A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION [J].
Cai, Jian-Feng ;
Candes, Emmanuel J. ;
Shen, Zuowei .
SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) :1956-1982
[4]  
CAO XC, 2015, PROC CVPR IEEE, P586, DOI DOI 10.1109/CVPR.2015.7298657
[5]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[6]   Convex and Semi-Nonnegative Matrix Factorizations [J].
Ding, Chris ;
Li, Tao ;
Jordan, Michael I. .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (01) :45-55
[7]   Sparse Subspace Clustering: Algorithm, Theory, and Applications [J].
Elhamifar, Ehsan ;
Vidal, Rene .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (11) :2765-2781
[8]   Multi-View Subspace Clustering [J].
Gao, Hongchang ;
Nie, Feiping ;
Li, Xuelong ;
Huang, Heng .
2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, :4238-4246
[9]   From few to many: Illumination cone models for face recognition under variable lighting and pose [J].
Georghiades, AS ;
Belhumeur, PN ;
Kriegman, DJ .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (06) :643-660
[10]  
Gonen M., 2014, P ADV NEUR INF PROC, P1305