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

  • Authors:
  • Eunseog Youn;Lars Koenig;Myong K. Jeong;Seung H. Baek

  • Affiliations:
  • Department of Computer Science, Texas Tech University, Lubbock, TX 79409-3104, USA;Department of Computer Science, Texas Tech University, Lubbock, TX 79409-3104, USA;Department of Industrial and Systems Engineering, Rutgers, The State University of New Jersey, Piscataway, NJ 08854-8003, USA and Department of Industrial and Systems Engineering, Korea Advanced I ...;Department of Industrial and Information Engineering, University of Tennessee, Knoxville, TN 37996-0700, USA

  • Venue:
  • Expert Systems with Applications: An International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 12.05

Visualization

Abstract

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.