DMIB: Dual-Correlated Multivariate Information Bottleneck for Multiview Clustering

被引:19
作者
Hu, Shizhe [1 ]
Shi, Zenglin [2 ]
Ye, Yangdong [1 ]
机构
[1] Zhengzhou Univ, Sch Informat Engn, Zhengzhou 450001, Peoples R China
[2] Univ Amsterdam, Inst Informat, NL-1098 XK Amsterdam, Netherlands
基金
中国国家自然科学基金;
关键词
Correlation; Clustering algorithms; Clustering methods; Convergence; Bayes methods; Cybernetics; Reliability; Multivariate information bottleneck (MIB); multiview clustering (MVC); unsupervised learning; FEATURES;
D O I
10.1109/TCYB.2020.3025636
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiview clustering (MVC) has recently been the focus of much attention due to its ability to partition data from multiple views via view correlations. However, most MVC methods only learn either interfeature correlations or intercluster correlations, which may lead to unsatisfactory clustering performance. To address this issue, we propose a novel dual-correlated multivariate information bottleneck (DMIB) method for MVC. DMIB is able to explore both interfeature correlations (the relationship among multiple distinct feature representations from different views) and intercluster correlations (the close agreement among clustering results obtained from individual views). For the former, we integrate both view-shared feature correlations discovered by learning a shared discriminative feature subspace and view-specific feature information to fully explore the interfeature correlation. This allows us to attain multiple reliable local clustering results of different views. Following this, we explore the intercluster correlations by learning the shared mutual information over different local clusterings for an improved global partition. By integrating both correlations, we formulate the problem as a unified information maximization function and further design a two-step method for optimization. Moreover, we theoretically prove the convergence of the proposed algorithm, and discuss the relationships between our method and several existing clustering paradigms. The experimental results on multiple datasets demonstrate the superiority of DMIB compared to several state-of-the-art clustering methods.
引用
收藏
页码:4260 / 4274
页数:15
相关论文
共 75 条
[1]  
Amini M., 2009, Adv. Neural Inf. Process. Syst., P28
[2]  
[Anonymous], 2002, J. Mach. Learn. Res
[3]  
[Anonymous], 2006, 2006 IEEE COMPUTER S
[4]   SURF: Speeded up robust features [J].
Bay, Herbert ;
Tuytelaars, Tinne ;
Van Gool, Luc .
COMPUTER VISION - ECCV 2006 , PT 1, PROCEEDINGS, 2006, 3951 :404-417
[5]   Multi-view low-rank sparse subspace clustering [J].
Brbic, Maria ;
Kopriva, Ivica .
PATTERN RECOGNITION, 2018, 73 :247-258
[6]   Non-negative Matrix Factorization on Manifold [J].
Cai, Deng ;
He, Xiaofei ;
Wu, Xiaoyun ;
Han, Jiawei .
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, :63-+
[7]  
Cai X., 2013, P 23 INT JOINT C ART
[8]   Diversity-induced Multi-view Subspace Clustering [J].
Cao, Xiaochun ;
Zhang, Changqing ;
Fu, Huazhu ;
Liu, Si ;
Zhang, Hua .
2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, :586-594
[9]  
Chaudhuri K., 2009, P P 26 ANN INT C MAC, P129
[10]  
Cover T. M., 2005, Wiley Series in Telecommunications and Signal Processing, V1st, DOI 10.1002/047174882X