.png){kind=icon}
返回
A new and fast implementation for null space based linear discriminant analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2009.10.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a new implementation for the null space based linear discriminant analysis. The main features of our implementation include: (i) the optimal transformation matrix is obtained easily by only orthogonal transformations without computing any eigendecomposition and singular value decomposition (SVD), consequently, our new implementation is eigendecomposition-free and SVD-free: (ii) its main computational complexity is from a economic QR factorization of the data matrix and a economic QR factorization of a n x n matrix with column pivoting, here n is the sample size, thus our new implementation is a fast one. The effectiveness of our new implementation is demonstrated by some real-world data sets. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Dimensionality reduction
Linear discriminant analysis
Null space based linear discriminant analysis
QR factorization
Singular value decomposition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
分享收藏
查看更多内容