Fast Dual Selection using Genetic Algorithms for Large Data Sets

Authors

  • Frédéric Ros Orleans University, Laboratoire Prisme Orléans, France
  • Rachid Harba Orleans University, Laboratoire Prisme Orléans, France
  • Marco Pintore PILA, Saint Jean de la Ruelle, France

Keywords:

instance and feature selection, scaling, genetic algorithms, k nearest neighbors

Abstract

This paper is devoted to feature and instance selection managed by genetic algorithms (GA) in the context of supervised classification. We propose a GA encoded by binary chromosomes having the same size as the feature space for selecting features in which each evaluated chromosome delivers a set of instances. The main aim is to optimize the processing time, which is particularly problematic when handling large databases. A key feature of our approach is the variable fitness evaluation based on scalability methodologies. Experimental results indicate that the preliminary version of the proposed algorithm can significantly reduce the computation time and is therefore applicable to high-dimensional data sets.

Downloads

Download data is not yet available.

Downloads

Published

2014-04-01

How to Cite

Frédéric Ros, Rachid Harba, & Marco Pintore. (2014). Fast Dual Selection using Genetic Algorithms for Large Data Sets. International Journal of Computer Information Systems and Industrial Management Applications, 6, 11. Retrieved from https://cspub-ijcisim.org/index.php/ijcisim/article/view/261

Issue

Section

Original Articles