A subspace clustering algorithm based on simultaneously sparse and low-rank representation
DOI10.3233/JIFS-16771zbMATH Open1381.62182OpenAlexW2665428045MaRDI QIDQ4598437FDOQ4598437
Authors: Xiaolan Liu, Miao Yi, Le Han, Xue Deng 
Publication date: 21 December 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/jifs-16771
Recommendations
- A subspace clustering method based on class-wise sparse and low-rank representation
- Subspace clustering by \((k,k)\)-sparse matrix factorization
- Low-rank local tangent space embedding for subspace clustering
- An efficient matrix factorization based low-rank representation for subspace clustering
- Subspace learning by \(\ell^0\)-induced sparsity
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cited In (24)
- Side-information-induced reweighted sparse subspace clustering
- Sparse subspace clustering for data with missing entries and high-rank matrix completion
- Laplacian regularizer hyperbolic tangent function low-rank subspace clustering algorithm
- Low-rank local tangent space embedding for subspace clustering
- A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
- Weighted low rank subspace clustering based on \({\ell_2}\) norm
- Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
- Local subspace clustering
- An efficient matrix factorization based low-rank representation for subspace clustering
- Non-convex low-rank representation combined with rank-one matrix sum for subspace clustering
- Learning transformations for clustering and classification
- A subspace clustering method based on class-wise sparse and low-rank representation
- Latent low-rank representation
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
- Self-regularized fixed-rank representation for subspace segmentation
- A folded concave penalty regularized subspace clustering method to integrate affinity and clustering
- Beyond low-rank representations: orthogonal clustering basis reconstruction with optimized graph structure for multi-view spectral clustering
- Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization
- Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data
- Subspace clustering using a low-rank constrained autoencoder
- How to Round Subspaces: A New Spectral Clustering Algorithm
- Subspace learning by \(\ell^0\)-induced sparsity
- Identifiability Conditions and Subspace Clustering in Sparse BSS
- Subspace clustering by \((k,k)\)-sparse matrix factorization
This page was built for publication: A subspace clustering algorithm based on simultaneously sparse and low-rank representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598437)
