The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Provable Subspace Clustering: When LRR Meets SSC
Abstract
An important problem in analyzing big data is subspace clustering, i.e., to represent a collection of points in a high-dimensional space via the union of low-dimensional subspaces. Sparse subspace clustering (SSC) and Low-rank representation (LRR) are the state-of-the-art methods for this task. These two methods are fundamentally similar in that both are based on convex optimization exploiting the intuition of “Self-Expressiveness”. The main difference is that the SSC minimizes the vector ℓ1norm of the representation matrix to induce sparsity while LRR minimizes the nuclear norm (aka trace norm) to promote a low-rank structure. Because the representation matrix is often simultaneously sparse and low-rank, we propose a new algorithm, termed Low-rank sparse subspace clustering (LRSSC), by the combining SSC and LRR, and develop theoretical guarantees of the success of the algorithm. The results reveal interesting insights into the strengths and the weaknesses of SSC and LRR, and demonstrate how the LRSSC can take advantage of both methods in preserving the “Self-Expressiveness Property” and “Graph Connectivity” at the same time. A byproduct of our analysis is that it also expands the theoretical guarantee of SSC to handle cases when the subspaces have arbitrarily small canonical angles but are “nearly independent”.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Cited by
Multi-view low-rank sparse subspace clustering
Brbić, M., & Kopriva, I. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.08.024 · Cited by 483
Low-Rank and Sparse Representation for Hyperspectral Image Processing: A review
Peng, J., Sun, W., Li, H.-C., Li, W., Meng, X., Ge, C., & Du, Q. (2022) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2021.3075491 · Cited by 285
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
You, C., Li, C.-G., Robinson, D. P., & Vidal, R. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.426 · Cited by 263
Metadata
- Authors
- Wang, Y.-X., Xu, H., & Leng, C.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2019-09
- Volume
- 65
- Issue
- 9
- Pages
- 5406-5432
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2144902590
- Cited by
- 175
- References
- 1
- FWCI
- 7.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Provable Subspace Clustering: When LRR Meets SSC. https://app.cochat.ai/papers/10.1109/tit.2019.2915593
- The paper
- Wang, Y.-X., Xu, H., & Leng, C. (2019). Provable Subspace Clustering: When LRR Meets SSC. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2019.2915593
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.