4.6 Article

Robust automated graph regularized discriminative non-negative matrix factorization

期刊

MULTIMEDIA TOOLS AND APPLICATIONS
卷 80, 期 10, 页码 14867-14886

出版社

SPRINGER
DOI: 10.1007/s11042-020-10410-w

关键词

Non-negative matrix factorization; Robust constraint; Adaptive graph learning; Discriminative information; Face recognition

资金

  1. National Natural Science Foundation of China [61906098, 61701258, 61872190, 61906099, 61972210]
  2. Natural Science Foundation of the Jiangsu Higher Education Institutions of China [18KJB520034]

向作者/读者索取更多资源

The new method RAGDNMF combines robustness, adaptive graph learning and discrimination information, aiming to learn a good projection matrix for removing redundant information while preserving effective components. Face recognition experiments on four benchmark datasets demonstrate the effectiveness of the proposed method.
Non-negative matrix factorization (NMF) and its variants have been widely employed in clustering and classification task. However, the existing methods do not consider robustness, adaptive graph learning and discrimination information at the same time. To solve this problem, a new nonnegative matrix factorization method is proposed, which is called robust automated graph regularized discriminative non-negative matrix factorization (RAGDNMF). Specifically, L-2,L-1 norm is used to describe the reconstruction error, the appropriate Laplacian graph is automatically learned and the label information of the training set is added as the regularization term. The ultimate goal is to learn a good projection matrix, which can remove redundant information while preserving the effective components. In addition, we give the multiplicative updating rules for solving optimization problems and convergence proof of objective function. Face recognition experiments on four benchmark datasets show the effectiveness of our proposed method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据