<abstract xmlns="http://www.w3.org/1999/xhtml"><p>The feature selection problem often occurs in pattern recognition and, more specifically, classification. Although these patterns could contain a large number of features, some of them could prove to be irrelevant, redundant or even detrimental to classification accuracy. Thus, it is important to remove these kinds of features, which in turn leads to problem dimensionality reduction and could eventually improve the classification accuracy. In this paper an approach to dimensionality reduction based on differential evolution which represents a wrapper and explores the solution space is presented. The solutions, subsets of the whole feature set, are evaluated using the k-nearest neighbour algorithm. High quality solutions found during execution of the differential evolution fill the archive. A final solution is obtained by conducting k-fold crossvalidation on the archive solutions and selecting the best one. Experimental analysis is conducted on several standard test sets. The classification accuracy of the k-nearest neighbour algorithm using the full feature set and the accuracy of the same algorithm using only the subset provided by the proposed approach and some other optimization algorithms which were used as wrappers are compared. The analysis shows that the proposed approach successfully determines good feature subsets which may increase the classification accuracy.</p></abstract>

The feature selection problem often occurs in pattern recognition and, more specifically, classification. Although these patterns could contain a large number of features, some of them could prove to be irrelevant, redundant or even detrimental to classification accuracy. Thus, it is important to remove these kinds of features, which in turn leads to problem dimensionality reduction and could eventually improve the classification accuracy. In this paper an approach to dimensionality reduction based on differential evolution which represents a wrapper and explores the solution space is presented. The solutions, subsets of the whole feature set, are evaluated using the k-nearest neighbour algorithm. High quality solutions found during execution of the differential evolution fill the archive. A final solution is obtained by conducting k-fold crossvalidation on the archive solutions and selecting the best one. Experimental analysis is conducted on several standard test sets. The classification accuracy of the k-nearest neighbour algorithm using the full feature set and the accuracy of the same algorithm using only the subset provided by the proposed approach and some other optimization algorithms which were used as wrappers are compared. The analysis shows that the proposed approach successfully determines good feature subsets which may increase the classification accuracy.

A differential evolution approach to dimensionality reduction for classification needs

Faculty of Electrical Engineering J.J. Strossmayer University of Osijek, Kneza Trpimira 2b, 31000 Osijek, Croatia

International Journal of Applied Mathematics and Computer Science

The feature selection problem often occurs in pattern recognition and, more specifically, classification. Although these patterns could contain a large number...

A differential evolution approach to dimensionality reduction for classification needs

Online veröffentlicht: 25. März 2014

Seitenbereich: 111 - 122

DOI: https://doi.org/10.2478/amcs-2014-0009

Schlüsselwörter
classification, differential evolution, feature subset selection, k-nearest neighbour algorithm, wrapper method.

This content is open access.

A differential evolution approach to dimensionality reduction for classification needs

Online veröffentlicht: 25. März 2014

Seitenbereich: 111 - 122

DOI: https://doi.org/10.2478/amcs-2014-0009

Schlüsselwörterclassification, differential evolution, feature subset selection, k-nearest neighbour algorithm, wrapper method.

This content is open access.

Schlüsselwörter
classification, differential evolution, feature subset selection, k-nearest neighbour algorithm, wrapper method.