模式识别与人工智能
Friday, May. 2, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2013, Vol. 26 Issue (3): 242-246    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Sparse Regularized Non-Negative Matrix Factorization through Online Learning
XUE Mo-Gen1,2,XU Guo-Ming1,2,WANG Feng2
1. School of Computer and Information,Hefei University of Technology,Hefei 230009
2.Army Officer Academy of PLA,Hefei 230031

Download: PDF (1054 KB)   HTML (0 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  In order to overcome the inefficiency of non-negative matrix factorization,a fast approach based on online learning for sparse regularized non-negative matrix factorization is proposed. Firstly,the objective function is defined by imposing the regularization term to control the sparsity of the coefficient matrix,and the problem is transformed into the dictionary learning problem of sparse representation. Therefore,the object function can be solved by the online dictionary learning algorithm. Then,the block-coordinate descent algorithm is used to update the matrix in every iterative process,consequently,the convergence rate is improved. The experimental results show that the proposed method effectively preserves the structure information of images and simultaneously enhances the running efficiency evidently.
Key wordsSparse Regularization      Non-Negative Matrix Factorization      Block-Coordinate Descent      Online Learning     
Received: 14 November 2011     
ZTFLH: TP391  
  TN911.73  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
XUE Mo-Gen
XU Guo-Ming
WANG Feng
Cite this article:   
XUE Mo-Gen,XU Guo-Ming,WANG Feng. Sparse Regularized Non-Negative Matrix Factorization through Online Learning[J]. , 2013, 26(3): 242-246.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2013/V26/I3/242
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn