Affordable Access

Publisher Website

PLS-based recursive feature elimination for high-dimensional small sample

Authors
Journal
Knowledge-Based Systems
0950-7051
Publisher
Elsevier
Volume
55
Identifiers
DOI: 10.1016/j.knosys.2013.10.004
Keywords
  • High-Dimensional Small Samples (Hdss)
  • Partial Least Squares (Pls)
  • Recursive Feature Elimination (Rfe)
  • Feature Subset Consistency
  • Feature Subset Compactness
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract This paper focused on feature selection for high-dimensional small samples (HDSS). We first presented a general analytical framework for feature selection on a HDSS including selection strategy (single-feature ranking and multi-feature ranking) and evaluation criteria (feature subset consistency and compactness). Then we proposed partial least squares (PLS) based feature selection methods for HDSS and two theorems. The proposed methodologies include a PLS model for classification, parameter selection, PLSRanking, and PLS-based recursive feature elimination. Furthermore, we compared our proposed methods with several existing feature selection methods such as Support Vector Machine (SVM) based feature selection, SVM-based recursive feature elimination (SVMRFE), Random Forest (RF) based feature selection, RF-based recursive feature elimination (RFRFE), ReliefF algorithm and ReliefF-based recursive feature elimination (ReliefFRFE). Using twelve high-dimensional datasets from different areas of research, we evaluated the results in terms of accuracy (sensitivity and specificity), running time, and the feature subset consistency and compactness. The analysis demonstrated that the proposed approach from our research performed very well when handling both two-category and multi-category problems.

There are no comments yet on this publication. Be the first to share your thoughts.