A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
2015 International Conference on Sampling Theory and Applications (SampTA)
We describe the Fast Greedy Sparse Subspace Clustering (FGSSC) algorithm providing an efficient method for clustering data belonging to a few low-dimensional linear or affine subspaces. FGSSC is a modification of the SSC algorithm. The main difference of our algorithm from predecessors is its ability to work with noisy data having a high rate of erasures (missed entries at the known locations) and errors (corrupted entries at unknown locations). The algorithm has significant advantage overdoi:10.1109/sampta.2015.7148933 fatcat:5yiwgv47vfcu5eo5fgnefyr45u