摘要： 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. •An efficient genetic algorithm (EGA) is proposed for the data reduction problem.•Compared with GA, EGA contains four novel components.•The experimental results show that EGA performs the best in terms of classification accuracy.•EGA can produce the largest reduction rates and requires much less computational time than GA. 出版者： Amsterdam: Elsevier B.V 出版日期： 2014-05-01 出處： Decision Support Systems, 2014-05, Vol.61, p.79-92 資源來源： Elsevier ScienceDirect Journals Complete 版權： 2014 Elsevier B.V. 版權： 2015 INIST-CNRS 版權： Copyright Elsevier Sequoia S.A. May 2014 識別號： ISSN: 0167-9236 識別號： EISSN: 1873-5797 識別號： DOI: 10.1016/j.dss.2014.01.012 識別號： CODEN: DSSYDK
