DocumentCode
2909615
Title
Feature selection for support vector machines
Author
Hermes, L. ; Buhmann, Joachim M.
Author_Institution
Dept. of Comput. Sci. III, Bonn Univ., Germany
Volume
2
fYear
2000
fDate
2000
Firstpage
712
Abstract
In the context of support vector machines (SVM), high dimensional input vectors often reduce the computational efficiency and significantly slow down the classification process. In this paper, we propose a strategy to rank individual components according to their influence on the class assignments. This ranking is used to select an appropriate subset of the features. It replaces the original feature set without significant loss in classification accuracy. Often, the generalization ability of the classifier even increases due to the implicit regularization achieved by feature pruning
Keywords
computational complexity; feature extraction; generalisation (artificial intelligence); learning automata; pattern classification; SVM; component ranking; computational efficiency; feature pruning; feature selection; generalization ability; high-dimensional input vectors; pattern classification; support vector machines; Computational efficiency; Computer science; Lagrangian functions; Neural networks; Packaging; Support vector machine classification; Support vector machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2000. Proceedings. 15th International Conference on
Conference_Location
Barcelona
ISSN
1051-4651
Print_ISBN
0-7695-0750-6
Type
conf
DOI
10.1109/ICPR.2000.906174
Filename
906174
Link To Document