Robust Subspace Clustering via Tighter Rank Approximation

30 Oct 2015 Zhao Kang Chong Peng Qiang Cheng

Matrix rank minimization problem is in general NP-hard. The nuclear norm is used to substitute the rank function in many recent studies... (read more)

PDF Abstract


Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper

🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet