Self-taught Multi-view Spectral Clustering. (June 2023)

• Record Type: Journal Article
• Authors: Zhong, Guo; Pun, Chi-Man
• Is Part Of: Pattern recognition. Volume 138(2023)
• Publication Date: 2023-06
• Subjects: Graph clustering -- spectral rotation -- spectral clustering -- multi-view clustering; Pattern perception -- Periodicals; Perception des structures -- Périodiques; Patroonherkenning; 006.4
• DOI: 10.1016/j.patcog.2023.109349
• Languages: English
• ISSNs: 0031-3203

Abstract

Highlights: We propose a novel Self-taught Multi-view Spectral Clustering (SMSC) framework, which can directly obtain a discrete indicator matrix. Our SMSC is devised to integrate adaptive weighting, Laplacian embedding (spectral embedding), consensus graph learning, and discrete indicator matrix learning into a unified framework. Our SMSC can dynamically update the consensus graph based on the feedback of the discrete cluster label matrix and vice versa. An efficient algorithm is proposed to solve the challenging discrete optimization problem alternately. Abstract: By integrating multiple views, i.e., multi-view learning (ML), we can discover the underlying data structures so that the performance of learning tasks can improve. As a basic and important branch of ML, multi-view clustering has achieved great success recently in pattern recognition and machine learning communities. Most existing multi-view spectral clustering methods heavily adopt the relax-and-discretize strategy to obtain discrete cluster labels (clustering results), i.e., using predefined similarity graphs to learn a consensus Laplacian embedding shared by all views for K -means clustering. However, the above clustering strategy may significantly affect clustering performance since there is information loss between independent steps. In this paper, we establish a novel Self-taught Multi-view Spectral Clustering (SMSC) framework to address the above issue. As the main contributions of this paper, we provide two versions of SMSC based on convex combination and centroid graph fusion schemes. Specifically, a self-taught mechanism is introduced in SMSC, which can effectively feedback the manifold structure induced by Laplacian embedding and the cluster information hidden in the discrete indicator matrix to learn an optimal consensus similarity graph for graph partitioning. The effectiveness of the proposed methods has been evaluated on real-world multi-view datasets, and experimental results show that our methods outperform other state-of-the-art baselines.