Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
From MaRDI portal
Publication:2147403
Abstract: Spectral-based subspace clustering methods have proved successful in many challenging applications such as gene sequencing, image recognition, and motion segmentation. In this work, we first propose a novel spectral-based subspace clustering algorithm that seeks to represent each point as a sparse convex combination of a few nearby points. We then extend the algorithm to constrained clustering and active learning settings. Our motivation for developing such a framework stems from the fact that typically either a small amount of labelled data is available in advance; or it is possible to label some points at a cost. The latter scenario is typically encountered in the process of validating a cluster assignment. Extensive experiments on simulated and real data sets show that the proposed approach is effective and competitive with state-of-the-art methods.
Recommendations
- Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
- Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates
- Sparse subspace clustering with jointly learning representation and affinity matrix
- A weighted-sparse subspace clustering method for image segmentation
- Weighted low rank subspace clustering based on \({\ell_2}\) norm
- Sparse Convex Clustering
- An accelerated gradient method for nonconvex sparse subspace clustering problem
- Weighted and robust learning of subspace representations
- Side-information-induced reweighted sparse subspace clustering
- A subspace clustering algorithm based on simultaneously sparse and low-rank representation
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- Algorithms for Fitting the Constrained Lasso
- Constrained Clustering
- Influence in principal components analysis
- On constrained spectral clustering and its applications
- Regularization and Variable Selection Via the Elastic Net
- Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework
- Subspace clustering of high-dimensional data: a predictive approach
- \(k\)-plane clustering
Cited in
(2)
This page was built for publication: Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147403)
