TY - JOUR
T1 - CCIM-SLR
T2 - Incomplete multiview co-clustering by sparse low-rank representation
AU - Liu, Zhenjiao
AU - Chen, Zhikui
AU - Lou, Kai
AU - Rajapaksha, Praboda
AU - Zhao, Liang
AU - Crespi, Noel
AU - Huang, Xiaodi
PY - 2024/7
Y1 - 2024/7
N2 - Clustering incomplete multiview data in real-world applications has become a topic of recent interest. However, producing clustering results from multiview data with missing views and different degrees of missing data points is a challenging task. To address this issue, we propose a co-clustering method for incomplete multiview data by sparse low-rank representation (CCIM-SLR). The proposed method integrates the global and local structures of incomplete multiview data and effectively captures the correlations between samples in a view, as well as between different views by using sparse low-rank learning. CCIM-SLR can alternate between learning the shared hidden view, visible view, and cluster partitions within a co-learning framework. An iterative algorithm with guaranteed convergence is used to optimize the proposed objective function. Compared with other baseline models, CCIM-SLR achieved the best performance in the comprehensive experiments on the five benchmark datasets, particularly on those with varying degrees of incompleteness.
AB - Clustering incomplete multiview data in real-world applications has become a topic of recent interest. However, producing clustering results from multiview data with missing views and different degrees of missing data points is a challenging task. To address this issue, we propose a co-clustering method for incomplete multiview data by sparse low-rank representation (CCIM-SLR). The proposed method integrates the global and local structures of incomplete multiview data and effectively captures the correlations between samples in a view, as well as between different views by using sparse low-rank learning. CCIM-SLR can alternate between learning the shared hidden view, visible view, and cluster partitions within a co-learning framework. An iterative algorithm with guaranteed convergence is used to optimize the proposed objective function. Compared with other baseline models, CCIM-SLR achieved the best performance in the comprehensive experiments on the five benchmark datasets, particularly on those with varying degrees of incompleteness.
KW - Co-clustering
KW - Incomplete multiview
KW - Shared hidden view
KW - Sparse low-rank representation
UR - https://rdcu.be/dVdFw
UR - http://www.scopus.com/inward/record.url?scp=85181524429&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85181524429&partnerID=8YFLogxK
U2 - 10.1007/s11042-023-17928-9
DO - 10.1007/s11042-023-17928-9
M3 - Article
SN - 1573-7721
VL - 83
SP - 61181
EP - 61211
JO - Multimedia Tools and Applications
JF - Multimedia Tools and Applications
IS - 22
ER -