LogDet Rank Minimization with Application to Subspace Clustering
Low-rank matrix is desired in many machine learning and computer vision problems. Most of the recent studies use the nuclear norm as a convex surrogate of the rank operator. However, all singular values are simply added together by the nuclear norm, and thus the rank may not be well approximated in...
Main Authors: | Zhao Kang, Chong Peng, Jie Cheng, Qiang Cheng |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Computational Intelligence and Neuroscience |
Online Access: | http://dx.doi.org/10.1155/2015/824289 |
Similar Items
-
Robust Subspace Discovery via Relaxed Rank Minimization
by: Wang, Xinggang, et al.
Published: (2014) -
A Fast Logdet Divergence Based Metric Learning Algorithm for Large Data Sets Classification
by: Jiangyuan Mei, et al.
Published: (2014-01-01) -
On the artefactual parasitic eubacteria clan in conditioned logdet phylogenies: heterotachy and ortholog identification artefacts as explanations
by: Bryant David, et al.
Published: (2010-11-01) -
Low-rank sparse subspace clustering with a clean dictionary
by: Cong-Zhe You, et al.
Published: (2021-01-01) -
A Fast Generalized Low Rank Representation Framework Based on $L_{2,p}$ Norm Minimization for Subspace Clustering
by: Tao Zhang, et al.
Published: (2017-01-01)