.png){kind=icon}
返回
An efficient algorithm to solve the small sample size problem for LDA
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2003.02.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an efficient algorithm to solve the most discriminant vectors of LDA for high-dimensional data set. The experiments on ORL face database confirm the effectiveness of the proposed method. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
linear discriminant analysis
null space
face recognition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
.png){kind=icon}
