.png){kind=icon}
.png){kind=icon}
Return
A computationally efficient scheme for feature extraction with kernel discriminant analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2015.08.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The kernel discriminant analysis (KDA), an extension of the linear discriminant analysis (LDA) and null space-based LDA into the kernel space, generally provides good pattern recognition (PR) performance for both small sample size (SSS) and non-SSS PR problems. Due to the eigen-decomposition technique adopted, however, the original scheme for the feature extraction with the KDA suffers from a high complexity burden. In this paper, we derive a transformation of the KDA into a linear equation problem, and propose a novel scheme for the feature extraction with the KDA. The proposed scheme is shown to provide us with a reduction of complexity without degradation of PR performance. In addition, to enhance the PR performance further, we address the incorporation of regularization into the proposed scheme. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Kernel discriminant analysis
Computational complexity
Lagrange method
Regularization
Pattern recognition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
No organization information available