Efficient Solvers for Sparse Subspace Clustering-Reference-Cited by-同舟云学术

Efficient Solvers for Sparse Subspace Clustering

Published:2020-07 Issue: Volume:172 Page:107548
ISSN:0165-1684
Container-title:Signal Processing
language:en
Short-container-title:Signal Processing

Author:

Pourkamali-Anaraki Farhad^ORCID,Folberth James,Becker Stephen

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Signal Processing,Software,Control and Systems Engineering

Reference52 articles.

1. Preconditioned data sparsification for big data with applications to PCA and K-means;Pourkamali-Anaraki;IEEE Transactions on Information Theory,2017

2. Scalable K-means clustering via lightweight coresets;Bachem,2018

3. A geometric analysis of subspace clustering with outliers;Soltanolkotabi;The Annals of Statistics,2012

4. Sparse and low-rank methods;Vidal,2016

5. Sparse subspace clustering: Algorithm, theory, and applications;Elhamifar;IEEE Transactions on Pattern Analysis and Machine Intelligence,2013

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Combining Global-Constrained Concept Factorization and a Regularized Gaussian Graphical Model for Clustering Single-Cell RNA-seq Data;Interdisciplinary Sciences: Computational Life Sciences;2023-10-10

2. A Survey on High-Dimensional Subspace Clustering;Mathematics;2023-01-13

3. Semi-Supervised Clustering via Cannot Link Relationship for Multiview Data;IEEE Transactions on Circuits and Systems for Video Technology;2022-12

4. A novel conformal deformation based sparse subspace clustering;International Journal of Machine Learning and Cybernetics;2022-11-24

5. The k-sparse LSR for subspace clustering via 0-1 integer programming;Signal Processing;2022-10