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

L1范数约束正交子空间非负矩阵分解
引用本文:韩东,盖杉.L1范数约束正交子空间非负矩阵分解[J].计算机系统应用,2018,27(9):205-209.
作者姓名:韩东  盖杉
作者单位:南昌航空大学 信息工程学院, 南昌 330063,南昌航空大学 信息工程学院, 南昌 330063
基金项目:国家自然科学基金(61563037);江西省自然科学基金(20171BAB202018)
摘    要:针对非负矩阵分解(NMF)相对稀疏或局部化描述原数据时导致的稀疏能力和程度比较弱的问题,提出了L1范数约束正交子空间非负矩阵分解方法.通过将L1范数约束引入到正交子空间非负矩阵分解的目标函数中,提升了分解结果的稀疏性.同时给出累乘迭代规则.在UCI、ORL和Yale三个数据库上进行的实验结果表明,该算法在聚类效果以及稀疏表达方面优于其他算法.

关 键 词:非负矩阵分解  正交性  L1范数  稀疏性
收稿时间:2018/1/29 0:00:00
修稿时间:2018/2/27 0:00:00

Non-Negative Matrix Factorization on Orthogonal Subspace with L1 Norm Constrains
HAN Dong and GAI Shan.Non-Negative Matrix Factorization on Orthogonal Subspace with L1 Norm Constrains[J].Computer Systems& Applications,2018,27(9):205-209.
Authors:HAN Dong and GAI Shan
Affiliation:School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China and School of Information Engineering, Nanchang Hangkong University, Nanchang 330063, China
Abstract:In order to solve the problem of unstable sparseness of Non-negative Matrix Factorization (NMF), an improved NMF on orthogonal subspace with L1 norm constraints was proposed. L1 norm constrained was introduced into the objective function of NMF on Orthogonal Subspace (NMFOS), which enhanced the sparsity of the decomposition results. The multiplicative updating procedure was also produced. Experiments on UCI, ORL, and Yale show that this algorithm is superior to other algorithms in clustering and sparse representation.
Keywords:Non-negative Matrix Factorization (NMF)  orthogonality  L1 norm  sparsity
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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