Low-Rank Structure Learning via Nonconvex Heuristic Recovery

In this paper, we propose a nonconvex framework to learn the essential low-rank structure from corrupted data. Different from traditional approaches, which directly utilizes convex norms to measure the sparseness, our method introduces more reasonable nonconvex measurements to enhance the sparsity i...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transaction on neural networks and learning systems Vol. 24; no. 3; pp. 383 - 396
Main Authors:	Deng, Yue, Dai, Qionghai, Liu, Risheng, Zhang, Zengke, Hu, Sanqing
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.03.2013 Institute of Electrical and Electronics Engineers
Subjects:	Adaptation models Applied sciences Artificial intelligence Clustering algorithms Compressive sensing Computer science; control theory; systems Data processing. List processing. Character string processing Detection, estimation, filtering, equalization, prediction Exact sciences and technology Heuristic algorithms Information, signal and communications theory Learning and adaptive systems log-sum heuristic matrix learning Memory organisation. Data processing Minimization nuclear norm minimization Optimization Signal and communications theory Signal processing algorithms Signal, noise Software Sparse matrices sparse optimization Telecommunications and information theory Structure learning log-sum heuristic Partial ordering Minimization nuclear norm minimization Modeling Optimization Subsampling Stationary condition matrix learning Upper bound Experimental result Compressive sensing sparse optimization Heuristic method Sparse representation Objective function Data structure Principal component analysis Non convex analysis
ISSN:	2162-237X, 2162-2388
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!