Robust Nonnegative Matrix Factorization with Local Similarity Learning
Author:
Affiliation:
College of Computer Science and Technology, Qingdao University, Qingdao 266071, China
Fund Project:
摘要
|
图/表
|
访问统计
|
参考文献
|
相似文献
|
引证文献
|
资源附件
摘要:
现有的非负矩阵分解方法往往聚焦于数据全局结构信息的学习,在很多情况下忽略了对数据局部信息的学习,而局部学习的方法也通常局限于流行学习,存在一些缺陷。为解决这一问题,提出了一种基于数据局部相似性学习的鲁棒非负矩阵分解算法(Robust nonnegative matrix factorization with local similarity learning, RLS-NMF)。采用一种新的数据局部相似性学习方法,它与流形方法存在显著区别,能够同时学习数据的全局结构信息,从而能挖掘数据类内相似和类间相离的性质。同时,考虑到现实应用中的数据存在异常值和噪声,该算法还使用l2,1范数拟合特征残差,过滤冗余的噪声信息,保证了算法的鲁棒性。多个基准数据集上的实验结果显示了该算法的最优性能,进一步证明了该算法的有效性。
Abstract:
The existing nonnegative matrix factorization methods mainly focus on learning global structure of the data, while ignoring the learning of local information. Meanwhile, for those methods that attempt to exploit local similarity, the manifold learning is often adopted, which suffers some issues. To solve this problem, a new method named the robust nonnegative matrix factorization with local similarity learning (RLS-NMF) is proposed. In this paper, a new local similarity learning method is adopted, which is starkly different from the widely used manifold learning. Moreover, the new method can simultaneously learn the global structural information of the data, and thus exploit the intra-class similarity and the inter-class separability of the data. To address the issues of outliers and noise effects in real word applications, the l2,1 norm is used to fit the residuals to filter the redundant noise information, ensuring the robustness of the algorithm. Extensive experimental results show the superior performance of the proposed method on several benchmark datasets, further demonstrating its effectiveness.