Smoothed Multi-View Subspace Clustering
arXiv:2106.09875
Abstract
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.
arXiv commentAccepted by International Conference on Neural Computing for Advanced Applications 2021
References in corpus (6)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Robust Recovery of Subspace Structures by Low-Rank Representation
- Towards K-means-friendly Spaces: Simultaneous Deep Learning and Clustering
- Multi-view Low-rank Sparse Subspace Clustering
- Robust Graph Learning from Noisy Data
- Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering