Convex Sparse Spectral Clustering: Single-view to Multi-view

Abstract

Spectral Clustering (SC) is one of the most widely used methods for data clustering. It first finds a low-dimensonal embedding $U$ of data by computing the eigenvectors of the normalized Laplacian matrix, and then performs k-means on $U^{\top }$ to get the final clustering result. In this work, we observe that, in the ideal case, $U{U}^{\top }$ should be block diagonal and thus sparse. Therefore we propose the Sparse Spectral Clustering (SSC) method which extends SC with sparse regularization on $U{U}^{\top }$. To address the computational issue of the nonconvex SSC model, we propose a novel convex relaxation of SSC based on the convex hull of the fixed rank projection matrices. Then the convex SSC model can be efficiently solved by the Alternating Direction Method of \canyi{Multipliers} (ADMM). Furthermore, we propose the Pairwise Sparse Spectral Clustering (PSSC) which extends SSC to boost the clustering performance by using the multi-view information of data. Experimental comparisons with several baselines on real-world datasets testify to the efficacy of our proposed methods.

References in corpus (2)

• Projection onto the capped simplex
• Fast Proximal Linearized Alternating Direction Method of Multiplier with Parallel Splitting

Cited by in corpus (13)

• Multi-view Low-rank Sparse Subspace Clustering
• Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
• Semantic Invariant Multi-view Clustering with Fully Incomplete Information
• Sparse eigenbasis approximation: multiple feature extraction across spatiotemporal scales with application to coherent set identification
• MMES: Mixture Model based Evolution Strategy for Large-Scale Optimization
• Robust Localized Multi-view Subspace Clustering
• On Unifying Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization
• Approximate spectral clustering using both reference vectors and topology of the network generated by growing neural gas
• A Manifold Proximal Linear Method for Sparse Spectral Clustering with Application to Single-Cell RNA Sequencing Data Analysis
• A variable smoothing for Nonconvexly constrained nonsmooth optimization with application to sparse spectral clustering
• Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation
• Nonconvex Sparse Spectral Clustering by Alternating Direction Method of Multipliers and Its Convergence Analysis
• Consistency-aware and Inconsistency-aware Graph-based Multi-view Clustering