首页 | 本学科首页   官方微博 | 高级检索  
     

稀疏性正则化非负矩阵分解的在线学习方法
引用本文:薛模根,徐国明,王峰.稀疏性正则化非负矩阵分解的在线学习方法[J].模式识别与人工智能,2013,26(3):242-246.
作者姓名:薛模根  徐国明  王峰
作者单位:1.合肥工业大学计算机与信息学院合肥230009
2.解放军陆军军官学院合肥230031
基金项目:国家自然科学基金资助项目(No.41176158)
摘    要:针对非负矩阵分解效率低的不足,提出一种基于在线学习的稀疏性非负矩阵分解的快速方法.通过对目标函数添加正则化项来控制分解后系数矩阵的稀疏性,将问题转化成稀疏表示的字典学习问题,利用在线字典学习算法求解目标函数,并对迭代过程的矩阵更新进行转换,采取块坐标下降法进行矩阵更新,提高算法收敛速度.实验结果表明,该方法在有效保持图像特征信息的同时,运行效率得到提高.

关 键 词:稀疏性正则化  非负矩阵分解  块坐标下降法  在线学习  
收稿时间:2011-11-14

Sparse Regularized Non-Negative Matrix Factorization through Online Learning
XUE Mo-Gen,XU Guo-Ming,WANG Feng.Sparse Regularized Non-Negative Matrix Factorization through Online Learning[J].Pattern Recognition and Artificial Intelligence,2013,26(3):242-246.
Authors:XUE Mo-Gen  XU Guo-Ming  WANG Feng
Affiliation:1. School of Computer and Information,Hefei University of Technology,Hefei 230009
2.Army Officer Academy of PLA,Hefei 230031
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.
Keywords:Sparse Regularization  Non-Negative Matrix Factorization  Block-Coordinate Descent  Online Learning  
点击此处可从《模式识别与人工智能》浏览原始摘要信息
点击此处可从《模式识别与人工智能》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号