Multi-Objective Feature Subset Selection using Non-dominated Sorting Genetic Algorithm

This paper presents an evolutionary algorithm based technique to solve multi-objective feature subset selection problem. The data used for classification contains large number of features called attributes. Some of these attributes are not relevant and needs to be eliminated. In classification proce...

Descripción completa

Detalles Bibliográficos
Autores: Khan, A., R. Baig, A.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2015
País:México
Institución:UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO
Repositorio:Journal of Applied Research and Technology
Idioma:inglés
OAI Identifier:oai:ojs2.localhost:article/144
Acceso en línea:https://jart.icat.unam.mx/index.php/jart/article/view/144
Access Level:acceso abierto
Palabra clave:Optimization
genetic algorithm
classification
Feature subset selection.
Descripción
Sumario:This paper presents an evolutionary algorithm based technique to solve multi-objective feature subset selection problem. The data used for classification contains large number of features called attributes. Some of these attributes are not relevant and needs to be eliminated. In classification procedure, each feature has an effect on the accuracy, cost and learning time of the classifier. So, there is a strong requirement to select a subset of the features before building the classifier. This proposed technique treats feature subset selection as multi-objective optimization problem. This research uses one of the latest multi-objective genetic algorithms (NSGA - II). The fitness value of a particular feature subset is measured by using ID3. The testing accuracy acquired is then assigned to the fitness value. This technique is tested on several datasets taken from the UCI machine repository. The experiments demonstrate the feasibility of using NSGA-II for feature subset selection.