Enhancing Incremental Feature Subset Selection in High-Dimensional Databases by Adding a Backward Step

  • Bermejo P
  • de La Ossa L
  • Gamez J
  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature subset selection has become an expensive process due to the relatively recent appearance of high-dimensional databases. Thus, the need has arisen not only for reducing the dimensionality of these datasets, but also for doing it in an efficient way. We propose the design of a new backward search which performs better than other state-of-the-art algorithms in terms of size of the selected subsets and in the number of evaluations, by removing attributes given a smart decremental approach and, besides, it is guided using a heuristic which reduces the needed number of evaluations commonly expected from a backward search.

Cite

CITATION STYLE

APA

Bermejo, P., de La Ossa, L., Gamez, J. A., & Puerta, J. M. (2011). Enhancing Incremental Feature Subset Selection in High-Dimensional Databases by Adding a Backward Step. In Computer and Information Sciences II (pp. 93–97). Springer London. https://doi.org/10.1007/978-1-4471-2155-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free