arrow
Return

Nonlinear feature extraction based on centroids and kernel functions

delete2004-04-01
delete24
delete
OA
AI
C
Cheong Hee Park
H
Haesun Park
DOI:10.1016/j.patcog.2003.07.011delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
A nonlinear feature extraction method is presented which can reduce the data dimension down to the number of classes, providing dramatic savings in computational costs. The dimension reducing nonlinear transformation is obtained by implicitly mapping the input data into a feature space using a kernel function, and then finding a linear mapping based on an orthonormal basis of centroids in the feature space that maximally separates the between-class relationship. The experimental results demonstrate that our method is capable of extracting nonlinear features effectively so that competitive performance of classification can be obtained with linear classifiers in the dimension reduced space. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keywords:
cluster structure
dimension reduction
kernel functions
kernel orthogonal centroid method
linear discriminant analysis
nonlinear feature extraction
pattern classification
support vector machines
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

No organization information available