计算机科学 ›› 2014, Vol. 41 ›› Issue (3): 272-275.

• 人工智能 • 上一篇    下一篇

基于流形正则化的非光滑非负矩阵分解

姜伟,陈耀,杨炳儒   

  1. 辽宁师范大学数学学院 大连116029;辽宁师范大学数学学院 大连116029;北京科技大学计算机与通信工程学院 北京100083
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金项目(60875029)资助

Manifold Regularized-based Nonsmooth Nonnegative Matrix Factorization

JIANG Wei,CHEN Yao and YANG Bing-ru   

  • Online:2018-11-14 Published:2018-11-14

摘要: 经典的非光滑非负矩阵分解方法只能发现数据中的全局统计信息,对于非线性分布数据无能为力,而流形学习方法在探索高维非线性数据集真实几何结构方面具有明显优势。鉴于此,基于流形正则化思想,提出了一种新颖的基于流形正则化的非光滑非负矩阵分解方法。该方法不仅考虑了数据的几何结构,而且对编码系数矩阵和基矩阵同时进行稀疏约束,并将它们整合于单个目标函数中。构造了一个有效的乘积更新算法,并在理论上证明了算法的收敛性。标准数据集上的实验表明了MRnsNMF的有效性。

关键词: 非负矩阵分解,非光滑,流形正则化 中图法分类号TP181文献标识码A

Abstract: The classical Nonsmooth Nonnegative Matrix Factorization(nsNMF) method discovers only the global statistical information of data and fails in dealing with nonlinear distributed data,while the manifold learning algorithms show great power in exploring the faithful intrinsic geometry structures of high dimensional data set.To address this issue,based on manifold regularization,we developed a novel algorithm called Manifold Regularized-based Nonsmooth Nonnegative Matrix Factorization(MRnsNMF).It not only considers the geometric structure in the data representation,but also introduces sparseness constraint to both coding coefficient and basis matrix simultaneously,and integrates them into one single objective function.An efficient multiplicative updating procedure was produced along with its theoretic justification of the algorithmic convergence.The feasibility and effectiveness of MRnsNMF were verified on several standard data sets with promising results.

Key words: Non-negative matrix,Nonsmooth,Manifold regularization

[1] 姜伟,杨炳儒.局部敏感非负矩阵分解[J].计算机科学,2010,7(12):211-214
[2] Lee D D,Seung H S.Learning the parts of objects by non-negativematrix factorization[J].Nature,1999,401(6755):788-791
[3] Li Stan Z,Hou Xin-wen,Zhang Hong-jiang,et al.Learning spatially localized,parts-based representation[C]∥IEEE Conference on Computer Vision and Pattern Recognition.2001,1:207-212
[4] Hoyer P O.Non-negative sparse coding[C]∥IEEE Workshop on Neural Networks for Signal Processing.2002:557-565
[5] Liu W X,Zheng N N,Lu X F.Non-negative matrix factorization for visual coding[C]∥IEEE International Conference on Acoustics,Speech and Signal Processing.2003,3:293-296
[6] Hoyer P O.Non-negative matrix factorization with sparsenessconstraints [J].Journal of Machine Learning Research,2004,5(9):1457-1469
[7] Alberto P M,Carazo J M,Kochi K,et al.Nonsmooth Nonnegative Matrix Factorization [J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2006,8(3):403-414
[8] Belkin M,Niyogi P.Laplacian eigenmaps for dimensionality reduction and data representation[J].Neural Computations,2003,5(6):1373-1396
[9] Cai Deng,He Xiao-fei,Han Jia-wei,et al.Graph RegularizedNon-negative Matrix Factorization for Data Representation[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2011,8(33):1548-1560
[10] Hoyer P O.Non-negative matrix factorization with sparseness constraints [J].Journal of Machine Learning Research,2004,5(9):1457-1469

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!