文献学习(part90)--Robust latent low rank representation for subspace clustering

学习笔记，仅供参考，有错必纠

期刊：Neucom-2014

文章目录

• • Robust latent low rank representation for subspace clustering
  • • Background
    • the short of prior work
    • key idea and algorithm overview
    • the advantages of proposed algorithm
    • proposed algorithm
    • • Choosing the sparsest solution
      • Extending to noisy case
      • Clustering with robust LatLRR