Corpus ID: 11720065

Efficient Sparse Subspace Clustering by Nearest Neighbour Filtering

@article{Tierney2017EfficientSS,
  title={Efficient Sparse Subspace Clustering by Nearest Neighbour Filtering},
  author={S. Tierney and Yi Guo and Junbin Gao},
  journal={ArXiv},
  year={2017},
  volume={abs/1704.03958}
}
  • S. Tierney, Yi Guo, Junbin Gao
  • Published 2017
  • Computer Science
  • ArXiv
  • Sparse Subspace Clustering (SSC) has been used extensively for subspace identification tasks due to its theoretical guarantees and relative ease of implementation. However SSC has quadratic computation and memory requirements with respect to the number of input data points. This burden has prohibited SSCs use for all but the smallest datasets. To overcome this we propose a new method, k-SSC, that screens out a large number of data points to both reduce SSC to linear memory and computational… CONTINUE READING
    3 Citations
    A New Sparse Subspace Clustering by Rotated Orthogonal Matching Pursuit
    • 3
    A REVIEW ON SPARSE SUBSPACE CLUSTRING FOR HIGH DIMENSIONAL DATA(HDD)
    • Dr. Bharathi MalakReddy, Ambika, Dr. Bharathi Malakreddy
    • 2017

    References

    SHOWING 1-10 OF 63 REFERENCES
    Scalable Sparse Subspace Clustering
    • Xi Peng, L. Zhang, Z. Yi
    • Mathematics, Computer Science
    • 2013 IEEE Conference on Computer Vision and Pattern Recognition
    • 2013
    • 113
    • PDF
    Robust Subspace Clustering
    • 301
    • PDF
    Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit
    • 199
    • PDF
    Subspace Clustering for Sequential Data
    • 77
    • PDF
    Greedy feature selection for subspace clustering
    • 142
    • PDF
    Fast Low-Rank Subspace Segmentation
    • 37
    • PDF
    Greedy Subspace Clustering
    • 86
    • PDF
    Robust Subspace Clustering via Thresholding
    • 126
    • PDF
    Sparse subspace clustering
    • 803
    • PDF
    A Geometric Analysis of Subspace Clustering with Outliers
    • 341
    • PDF