Signal Processing 2019 DOI: 10.1016/j.sigpro.2019.05.017 View full text
Maryam Abdolali, Nicolas Gillis, Mohammad Rahmati

Abstract: Sparse subspace clustering (SSC) is one of the current state-of-the-art methods for partitioning data points into the union of subspaces, with strong theoretical guarantees. However, it is not practical for large data sets as it requires solving a LASSO problem for each data point, where the number of variables in each LASSO problem is the number of data points. To improve the scalability of SSC, we propose to select a few sets of anchor points using a randomized hierarchical clustering method, and, for each …

expand abstract