.png){kind=icon}
Return
Feature extractions for small sample size classification problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TGRS.2006.885074.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Much research has shown that the definitions of within-class and between-class scatter matrices and regularization technique are the key components to design a feature extraction for small sample size problems. In this paper, we illustrate the importance of another key component, eigenvalue decomposition method, and a new regularization technique was proposed. In the hyperspectral image experiment, the effects of these three components of feature extraction are explored on ill-posed and poorly posed conditions. The experimental. results show that different regularization methods need to cooperate with different eigenvalue decomposition methods to reach the best performance, the proposed regularization method, regularized feature extraction (RFE) outperform others, and the best feature extraction for a small sample size classification problem is RFE with nonparametric. weighted scatter matrices.
Keywords:
eigenvalue decomposition
feature extraction
genetic algorithm (GA)
regularization
small sample size classification
Journal
IF:
8.6
Papers:
2.1W
Citations:
10.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveFamily physicians’ perspectives on interprofessional teamwork: Findings from a qualitative study
PREAI
ShareSave
View more