Beyond Linear Subspace Clustering: A Comparative Study of Nonlinear Manifold Clustering Algorithms
arXiv:2103.10656 · doi:10.1016/j.cosrev.2021.100435
Abstract
Subspace clustering is an important unsupervised clustering approach. It is based on the assumption that the high-dimensional data points are approximately distributed around several low-dimensional linear subspaces. The majority of the prominent subspace clustering algorithms rely on the representation of the data points as linear combinations of other data points, which is known as a self-expressive representation. To overcome the restrictive linearity assumption, numerous nonlinear approaches were proposed to extend successful subspace clustering approaches to data on a union of nonlinear manifolds. In this comparative study, we provide a comprehensive overview of nonlinear subspace clustering approaches proposed in the last decade. We introduce a new taxonomy to classify the state-of-the-art approaches into three categories, namely locality preserving, kernel based, and neural network based. The major representative algorithms within each category are extensively compared on carefully designed synthetic and real-world data sets. The detailed analysis of these approaches unfolds potential research directions and unsolved challenges in this field.
arXiv comment55 pages
References in corpus (23)
- Robust Recovery of Subspace Structures by Low-Rank Representation
- A survey of sparse representation: algorithms and applications
- Ultra-Scalable Spectral Clustering and Ensemble Clustering
- A geometric analysis of subspace clustering with outliers
- Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
- Robust subspace clustering
- Deep Multimodal Subspace Clustering Networks
- Low-rank Kernel Learning for Graph-based Clustering
- Normalized Loss Functions for Deep Learning with Noisy Labels
- Beyond Synthetic Noise: Deep Learning on Controlled Noisy Labels
- Sketched Subspace Clustering
- Compressive Spectral Clustering
- Algebraic Clustering of Affine Subspaces
- Scalable and Robust Sparse Subspace Clustering Using Randomized Clustering and Multilayer Graphs
- Efficient Solvers for Sparse Subspace Clustering
- On Geometric Analysis of Affine Sparse Subspace Clustering
- Adaptive Low-Rank Kernel Subspace Clustering
- Why Are Convolutional Nets More Sample-Efficient than Fully-Connected Nets?
- Twin Learning for Similarity and Clustering: A Unified Kernel Approach
- Self-weighted Multiple Kernel Learning for Graph-based Clustering and Semi-supervised Classification
- A Critique of Self-Expressive Deep Subspace Clustering
- Efficient Sparse Subspace Clustering by Nearest Neighbour Filtering
- Kernelized LRR on Grassmann Manifolds for Subspace Clustering