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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transaction on neural networks and learning systems Ročník 24; číslo 3; s. 383 - 396
Hlavní autoři:	Deng, Yue, Dai, Qionghai, Liu, Risheng, Zhang, Zengke, Hu, Sanqing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.03.2013 Institute of Electrical and Electronics Engineers
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!