Support vector-based feature selection using Fisher's linear discriminant and Support Vector Machine

Cited 28 time in webofscience Cited 0 time in scopus
  • Hit : 206
  • Download : 0
The problem of feature selection is to find a subset of features for optimal classification. A critical part of feature selection is to rank features according to their importance for classification. The Support Vector Machine (SVM) has been applied to a number of applications, such as bioinformatics, face recognition, text categorization, handwritten digit recognition, and so forth. Based on the success of the SVM, several feature selection algorithms that use it have recently been proposed. This paper proposes a new feature-ranking algorithm based on support vectors (SVs). Support vectors refer to those sample vectors that lie around the decision boundary between two different classes. Although SV-based feature ranking can be applied to any discriminant analysis, two linear discriminants are considered here: Fisher's linear discriminant and the Support Vector Machine. Features are ranked based on the weight associated with each feature or as determined by recursive feature elimination. The experiments show that our feature-ranking algorithms are competitive in accuracy with the existing methods and much faster.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2010-09
Language
English
Article Type
Article
Keywords

MICROARRAY EXPRESSION DATA; CANCER CLASSIFICATION; GENE SELECTION; RECOGNITION; FRAMEWORK

Citation

EXPERT SYSTEMS WITH APPLICATIONS, v.37, no.9, pp.6148 - 6156

ISSN
0957-4174
DOI
10.1016/j.eswa.2010.02.113
URI
http://hdl.handle.net/10203/226654
Appears in Collection
RIMS Journal Papers
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 28 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0