Download PDFOpen PDF in browser

Feature Selection Ensemble

18 pagesPublished: June 22, 2012


Many strategies have been exploited for the task of feature selection, in an effort to identify more compact and better quality feature subsets. Such techniques typically involve the use of an individual feature significance evaluation, or a measurement of feature subset consistency, that work together with a search algorithm in order to determine a quality subset. Feature selection ensemble aims to combine the outputs of multiple feature selectors, thereby producing a more robust result for the subsequent classifier learning tasks. In this paper, three novel implementations of the feature selection ensemble concept are introduced, generalising the ensemble approach so that it can be used in conjunction with many subset evaluation techniques, and search algorithms. A recently developed heuristic algorithm: harmony search is employed to demonstrate the approaches. Results of experimental comparative studies are reported in order to highlight the benefits of the present work. The
paper ends with a proposal to extend the application of feature selection ensemble to aiding the development of biped robots (inspired by the authors’ involvement in the joint celebration of Olympic and the centenary of the birth of Alan Turing).

Keyphrases: Data Reliability, Ensemble, Ensemble Construction, feature selection, Harmony Search

In: Andrei Voronkov (editor). Turing-100. The Alan Turing Centenary, vol 10, pages 289--306

BibTeX entry
  author    = {Qiang Shen and Ren Diao and Pan Su},
  title     = {Feature Selection Ensemble},
  booktitle = {Turing-100. The Alan Turing Centenary},
  editor    = {Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {10},
  pages     = {289--306},
  year      = {2012},
  publisher = {EasyChair},
  bibsource = {EasyChair,},
  issn      = {2398-7340},
  url       = {},
  doi       = {10.29007/rlxq}}
Download PDFOpen PDF in browser