Schatten-q regularizer constrained low rank subspace clustering model
Authors:
- Xiujun ZhangXZXiujun Zhang
- Chen XuCXChen Xu
- Xiaoli SunXSXiaoli Sun
- George BaciuGBGeorge Baciu
- 1 March 2016
- journal article
- research article
- Published by Elsevier in Neurocomputing
- Vol. 182, 36-47
Abstract
No abstract availableKeywords
Funding Information
- Hong Kong Research Grants Council (5100/12E)
- Specialized Research Fund for the Doctoral Program of Chinese Higher Education (20134408110001)
- National Natural Science Funds of China (61472257, 61402290)
This publication has 38 references indexed in Scilit:
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completionThe Annals of Statistics, 2011
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy ObservationsSIAM Journal on Optimization, 2011
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Thresholding-based iterative selection procedures for model selection and shrinkageElectronic Journal of Statistics, 2009
- Unsupervised segmentation of natural images via lossy data compressionComputer Vision and Image Understanding, 2008
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed DataSIAM Review, 2008
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Solving semidefinite-quadratic-linear programs using SDPT3Mathematical Programming, 2003
- Random sample consensusCommunications of the ACM, 1981