Solving feature subset selection problem by a Parallel Scatter Search

@article{GarcaLpez2006SolvingFS,
  title={Solving feature subset selection problem by a Parallel Scatter Search},
  author={F{\'e}lix Garc{\'i}a-L{\'o}pez and M. Garc{\'i}a-Torres and B. Meli{\'a}n-Batista and J. Moreno-P{\'e}rez and J. M. Moreno-Vega},
  journal={Eur. J. Oper. Res.},
  year={2006},
  volume={169},
  pages={477-489}
}
The aim of this paper is to develop a Parallel Scatter Search metaheuristic for solving the Feature Subset Selection Problem in classification. Given a set of instances characterized by several features, the classification problem consists of assigning a class to each instance. Feature Subset Selection Problem selects a relevant subset of features from the initial set in order to classify future instances. We propose two methods for combining solutions in the Scatter Search metaheuristic. These… Expand
178 Citations
A discrete particle swarm optimization method for feature selection in binary classification problems
Heuristic Approach to Solve Feature Selection Problem
Nature inspired feature selection meta-heuristics
Analysis of new variable selection methods for discriminant analysis
Data Mining with Scatter Search
A Parallel Computing Hybrid Approach for Feature Selection
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 34 REFERENCES
Robust feature selection algorithms
  • H. Vafaie, K. DeJong
  • Computer Science
  • Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93)
  • 1993
Wrappers for Feature Subset Selection
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem
Scatter Search: Methodology and Implementations in C
The Feature Selection Problem: Traditional Methods and a New Algorithm
Feature Subset Selection Using a Genetic Algorithm
A note on Genetic Algorithms for Large-Scale Feature Selection
...
1
2
3
4
...