arrow
返回

An efficient discriminant-based solution for small sample size problem

delete2009-05-01
delete58
PRE
AI
K
Koel Das
Z
Zoran Nenadić *
DOI:10.1016/j.patcog.2008.08.036delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Classification of high-dimensional statistical data is usually not amenable to standard pattern recognition techniques because of an underlying small sample size problem. To address the problem of high-dimensional data classification in the face of a limited number of samples, a novel principal component analysis (PCA) based feature extraction/classification scheme is proposed. The proposed method yields a piecewise linear feature subspace and is particularly well-suited to difficult recognition problems where achievable classification rates are intrinsically low. Such problems are often encountered in cases where classes are highly overlapped, or in cases where a prominent Curvature in data renders a projection onto a single linear subspace inadequate. The proposed feature extraction/classification method uses class-dependent PCA in Conjunction With linear discriminant feature extraction and performs well on a variety of real-world datasets, ranging from digit recognition to classification of high-dimensional bioinformatics and brain imaging data. (C) 2008 Elsevier Ltd. All rights reserved
Keyword:
Feature extraction
Principal component analysis
Classification
Linear discriminant analysis
Bayes error
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

University of California System 封面图
University of California System
学者数:
37.5W
论文数: 33.7W
被引数: 6.6K
U
university of california irvine
学者数:
2.3W
论文数: 1.7W
被引数: 55
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容