Towards high dimensional instance selection: An evolutionary approach

Chih‐Fong Tsai

doi:10.1016/j.dss.2014.01.012

Return

Towards high dimensional instance selection: An evolutionary approach

2014-05-01

PRE

Chih‐Fong Tsai *

Zong-Yao Chen

DOI：10.1016/j.dss.2014.01.012

Original

Original request for help

Save

Abstract

En 中文

Data reduction is an important data pre-processing step in the KDD process. It can be approached by the application of some instance selection algorithms to filter out unrepresentative or noisy data from a given (training) dataset. However, the performance of instance selection over very high dimensional data has not yet been fully examined. In this paper, we introduce a novel efficient genetic algorithm (EGA), which fits biological evolution into the evolutionary process. In other words, after long-term evolution, individuals find the most efficient way to allocate resources and evolve. The experimental study is based on four very high dimensional datasets ranging from 200 to 18,236 dimensions. In addition, four state-of-the-art algorithms including IB3, DROP3, ICF, and GA are compared with EGA. The experimental results show that EGA allows the k-NN and SVM classifiers to provide the most comparable classification performance with the baseline classifiers without instance selection. Particularly, EGA outperforms the four algorithms in terms of average classification accuracy. Moreover, EGA can produce the largest reduction rates (the same as GA) and it requires relatively less computational time than the other four algorithms. (C) 2014 Elsevier B.V. All rights reserved.

Keywords:

Data reduction

Instance selection

Data mining

Machine learning

Genetic algorithms

High dimensional data