The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Kernel sparse subspace clustering
Abstract
Subspace clustering refers to the problem of grouping data points that lie in a union of low-dimensional subspaces. One successful approach for solving this problem is sparse subspace clustering, which is based on a sparse representation of the data. In this paper, we extend SSC to non-linear manifolds by using the kernel trick. We show that the alternating direction method of multipliers can be used to efficiently find kernel sparse representations. Various experiments on synthetic as well real datasets show that non-linear mappings lead to sparse representation that give better clustering results than state-of-the-art methods.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Cited by
Structured AutoEncoders for Subspace Clustering
Peng, X., Feng, J., Xiao, S., Yau, W.-Y., Zhou, J. T., & Yang, S. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2848470 · Cited by 343
Metadata
- Authors
- Patel, V. M., & Vidal, R.
- Venue
- 2014 IEEE International Conference on Image Processing (ICIP)
- Publisher
- IEEE
- Published
- 2014-10
- Pages
- 2849-2853
- ISSN
- 1522-4880 (ISSN-L)
- OpenAlex
- W2017441234
- Cited by
- 237
- References
- 1
- FWCI
- 6.13
- Type
- conference paper
- 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: Kernel sparse subspace clustering. https://app.cochat.ai/papers/10.1109/icip.2014.7025576
- The paper
- Patel, V. M., & Vidal, R. (2014). Kernel sparse subspace clustering. 2014 IEEE International Conference on Image Processing (ICIP). https://doi.org/10.1109/icip.2014.7025576
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.