Provable Subspace Clustering: When LRR Meets SSC

DOI10.1109/TIT.2019.2915593zbMath1432.62193OpenAlexW2944309706MaRDI QIDQ5211377

Chenlei Leng, Yu-Xiang Wang, Huan Xu

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2019.2915593

zbMATH Keywords

convex optimizationsubspace clusteringsparse subspace clustering (SSC)low-rank representation (LRR)

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Applications of mathematical programming (90C90) Statistical aspects of big data and data science (62R07)

Related Items (6)

Unnamed Item ⋮ Unnamed Item ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Nonlinear subspace clustering using non-convex Schatten-p norm regularization ⋮ Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem ⋮ Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data

This page was built for publication: Provable Subspace Clustering: When LRR Meets SSC