.png){kind=icon}
返回
Marginal Fisher Analysis With Polynomial Matrix Function
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3208901.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Marginal fisher analysis (MFA) is a dimensionality reduction method based on a graph embedding framework. In contrast to traditional linear discriminant analysis (LDA), which requires the data to follow a Gaussian distribution, MFA is suitable for non-Gaussian data, and it has better pattern classification ability. However, MFA has the small-sample-size (SSS) problem. This paper aims to solve the small-sample-size problem while increasing the classification performance of MFA. Based on a matrix function dimensionality reduction framework, the criterion of the MFA method is reconstructed by using the polynomials matrix function transformation, and then a new MFA method is proposed, named PMFA (polynomial marginal fisher analysis). The major contributions of the proposed PMFA method are that it solves the small-sample-size problem of MFA, and it can enlarge the distance between marginal sample points of inter-class, so that it can get better pattern classification performance. Experiments on the public face datasets show that PMFA can get a better classification ability than MFA and its improved methods.
Keyword:
Principal component analysis
Symmetric matrices
Face recognition
Manifold learning
Eigenvalues and eigenfunctions
Training data
Pattern classification
Dimensionality reduction
manifold learning
marginal fisher analysis
matrix function
the small-sample-size (SSS) problem
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Discriminative Few Shot Learning of Facial Dynamics in Interview Videos for Autism Trait Classification自闭症特质分类访谈视频中面部动力学的区分性少镜头学习OAAI
OAAI分享收藏分享收藏
查看更多内容