Provable Subspace Clustering: When LRR Meets SSC

DOI10.1109/TIT.2019.2915593MaRDI QIDQ5211377zbMATH OpenOpenAlexFDO

Authors Yu-Xiang Wang, Huan Xu, Chenlei Leng

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 optimizationlow-rank representation (LRR)sparse subspace clustering (SSC)subspace clustering

Mathematics Subject Classification ID

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

Cited in

(9)

• Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
• Identifiability Conditions and Subspace Clustering in Sparse BSS
• Nonlinear subspace clustering using non-convex Schatten-p norm regularization
• Scalable interpretable multi-response regression via SEED
• scientific article; zbMATH DE number 7164743 (Why is no real title available?)
• Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data
• Unsupervised robust discriminative subspace representation based on discriminative approximate isometric embedding
• Multilinear algebra methods for higher-dimensional graphs
• Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211377)