3 papers
cs.LG2022
Greedier is Better: Selecting Multiple Neighbors per Iteration for Sparse Subspace Clustering
Jwo-Yuh Wu, Liang-Chi Huang, Wen-Hsuan Li +2
Sparse subspace clustering (SSC) using greedy-based neighbor selection, such as orthogonal matching pursuit (OMP), has been known as a popular computationally-efficient alternative…
stat.ML2020
Provable Noisy Sparse Subspace Clustering using Greedy Neighbor Selection: A Coherence-Based Perspective
Jwo-Yuh Wu, Wen-Hsuan Li, Liang-Chi Huang +3
Sparse subspace clustering (SSC) using greedy-based neighbor selection, such as matching pursuit (MP) and orthogonal matching pursuit (OMP), has been known as a popular computation…
cs.IT2019
Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates
Jwo-Yuh Wu, Liang-Chi Huang, Ming-Hsun Yang +1
Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new spa…