Multi-view Clustering by Spectral Structure Fusion and Novel Low-rank Approximation

In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representati...

Full description

Bibliographic Details
Main Authors: Liu, X. (Author), Long, Y. (Author), Murphy, S. (Author)
Format: Article
Language:English
Published: Korean Society for Internet Information 2022
Subjects:
Online Access:View Fulltext in Publisher
LEADER 02447nam a2200349Ia 4500
001 10.3837-tiis.2022.03.004
008 220425s2022 CNT 000 0 und d
020 |a 19767277 (ISSN) 
245 1 0 |a Multi-view Clustering by Spectral Structure Fusion and Novel Low-rank Approximation 
260 0 |b Korean Society for Internet Information  |c 2022 
856 |z View Fulltext in Publisher  |u https://doi.org/10.3837/tiis.2022.03.004 
520 3 |a In multi-view subspace clustering, how to integrate the complementary information between perspectives to construct a unified representation is a critical problem. In the existing works, the unified representation is usually constructed in the original data space. However, when the data representation in each view is very diverse, the unified representation derived directly in the original data domain may lead to a huge information loss. To address this issue, different to the existing works, inspired by the latest revelation that the data across all perspectives have a very similar or close spectral block structure, we try to construct the unified representation in the spectral embedding domain. In this way, the complementary information across all perspectives can be fused into a unified representation with little information loss, since the spectral block structure from all views shares high consistency. In addition, to capture the global structure of data on each view with high accuracy and robustness both, we propose a novel low-rank approximation via the tight lower bound on the rank function. Finally, experimental results prove that, the proposed method has the effectiveness and robustness at the same time, compared with the state-of-art approaches. Copyright © 2022 KSII 
650 0 4 |a ADMM 
650 0 4 |a ADMM 
650 0 4 |a Approximation theory 
650 0 4 |a Clustering algorithms 
650 0 4 |a Information loss 
650 0 4 |a Low rank approximations 
650 0 4 |a multi-view fusion 
650 0 4 |a Multi-view fusion 
650 0 4 |a Multi-view subspace clustering 
650 0 4 |a Multi-view subspace clustering 
650 0 4 |a Multi-views 
650 0 4 |a rank-norm approximation 
650 0 4 |a Rank-norm approximation 
650 0 4 |a spectral structure 
650 0 4 |a Spectral structure 
650 0 4 |a Subspace clustering 
700 1 |a Liu, X.  |e author 
700 1 |a Long, Y.  |e author 
700 1 |a Murphy, S.  |e author 
773 |t KSII Transactions on Internet and Information Systems