arrow
返回

Nonnegative matrix factorization with combined kernels for small data representation

delete2022-12-01
delete1
PRE
AI
H
HU Li-ying
陈宪 封面图
陈宪 (Xian Chen)
G
Gongde Guo
L
Lifei Chen *
DOI:10.1016/j.eswa.2022.118155delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Kernel nonnegative matrix factorization (KNMF) has emerged as a promising nonlinear data representation method, especially for applications with small sample sizes. Existing methods are usually based on a single kernel function, representing samples by the global or local features learned by the matrix factorization algorithm. In this paper, a combined kernel method is proposed and applied to data representation for small-sample face recognition in particular. Based on the combined kernel, which is a linear combination of the fractional power inner-product kernel and a newly defined Gaussian-type kernel, the new KNMF method is able to extract both global and local nonlinear features from the inputs. An efficient gradient decent algorithm is derived to solve the combined kernel nonnegative matrix factorization (CKNMF) problem, and a rigorous convergence proof is presented. The proposed method is experimentally evaluated on small image datasets, and the results demonstrate its superior performance than the state-of-the-art KNMF methods.
Keyword:
Combined kernel
Nonnegative matrix factorization
Data representation
Face recognition

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
2.9W
被引数:
10.2W

机构

F
Fujian Normal University
学者数:
1.2W
论文数: 8.0K
被引数: 1.3W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
Fast Learning With Polynomial Kernels
err2019-10-01
err7
PREAI
errLin, Shaobo; Zeng, Jinshan
err分享
err收藏
学者 查看更多内容