Smoothed Multi-View Subspace Clustering
In recent years, multi-view subspace clustering has achieved impressive performance due to the exploitation of complementary imformation across multiple views. However, multi-view data can be very complicated and are not easy to cluster in real-world applications. Most existing methods operate on raw data and may not obtain the optimal solution. In this work, we propose a novel multi-view clustering method named smoothed multi-view subspace clustering (SMVSC) by employing a novel technique, i.e., graph filtering, to obtain a smooth representation for each view, in which similar data points have similar feature values. Specifically, it retains the graph geometric features through applying a low-pass filter. Consequently, it produces a ``clustering-friendly" representation and greatly facilitates the downstream clustering task. Extensive experiments on benchmark datasets validate the superiority of our approach. Analysis shows that graph filtering increases the separability of classes.
Code (1)
Tasks
ClusteringMulti-view Subspace ClusteringSimilar Papers 제목 키워드 기반
Seeking Commonness and Inconsistencies: A Jointly Smoothed Approach to Multi-view Subspace Clustering
Multi-view subspace clustering aims to discover the hidden subspace structures from multiple views for robust clustering, and has been attracting considerable attention in recent years. Despite significant progress, most…
ClusteringMulti-view Subspace ClusteringRepresentation LearningMulti-view Subspace Clustering Networks with Local and Global Graph Information
This study investigates the problem of multi-view subspace clustering, the goal of which is to explore the underlying grouping structure of data collected from different fields or measurements. Since data do not always c…
ClusteringMulti-view Subspace ClusteringMulti-view Subspace Adaptive Learning via Autoencoder and Attention
Multi-view learning can cover all features of data samples more comprehensively, so multi-view learning has attracted widespread attention. Traditional subspace clustering methods, such as sparse subspace clustering (SSC…
ClusteringMULTI-VIEW LEARNINGEnriched Robust Multi-View Kernel Subspace Clustering
Subspace clustering is to find underlying low-dimensional subspaces and cluster the data points correctly. In this paper, we propose a novel multi-view subspace clustering method. Most existing methods suffer from two cr…
ClusteringMulti-view Subspace ClusteringMulti-view Low-rank Sparse Subspace Clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view …
ClusteringMulti-view Subspace Clustering