k-Top Scoring Pair Algorithm for feature selection in SVM with applications to microarray data classification

  • Authors:
  • Sejong Yoon;Saejoon Kim

  • Affiliations:
  • Sogang University, Department of Computer Science and Engineering, 121-742, Seoul, Korea;Sogang University, Department of Computer Science and Engineering, 121-742, Seoul, Korea

  • Venue:
  • Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on Pattern Recognition and Information Processing Using Neural Networks;Guest Editors: Fuchun Sun,Ying Tan,Cong Wang
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Top Scoring Pair (TSP) and its ensemble counterpart, k-Top Scoring Pair (k-TSP), were recently introduced as competitive options for solving classification problems of microarray data. However, support vector machine (SVM) which was compared with these approaches is not equipped with feature or variable selection mechanism while TSP itself is a kind of variable selection algorithm. Moreover, an ensemble of SVMs should also be considered as a possible competitor to k-TSP. In this work, we conducted a fair comparison between TSP and SVM-recursive feature elimination (SVM-RFE) as the feature selection method for SVM. We also compared k-TSP with two ensemble methods using SVM as their base classifier. Results on ten public domain microarray data indicated that TSP family classifiers serve as good feature selection schemes which may be combined effectively with other classification methods.