Instance Selection Using Evolutionary Algorithms: An Experimental Study - Advanced Techniques in Knowledge Discovery and Data Mining - page 150

z EAs outperform the classical algorithms, offering two main advantages
simultaneously, better data reduction percentages and higher classification
accuracy.
z The CHC algorithm is particularly appropriate as an IS algorithm.
Furthermore, the stratified model applied to TSS seems adequate for applying
EAs to large data sets. It has arisen as a powerful tool for obtaining training sets
for the C4.5 algorithm, independent of the IS algorithm used.
Finally, we wish to point out that future works may be directed at studying the
behavior of the evolutionary IS algorithms on databases with a large number of
instances.
References
[1] Adriaans, P., and Zantinge, D., Data Mining , Addison-Wesley, 1996.
[2] Back,T., Evolutionary Algorithms in Theory and Practice , Oxford, 1996.
[3] Back, T., Fogel, D., and Michalewicz, Z., Handbook of Evolutionary
Computation , Oxford University Press, 1997.
[4] Babu, T. R., and Murty, M. N., Comparison of genetic algorithms based
prototype selection schemes, Pattern Recognition , 34, 523-5, 2001.
[5] Baluja, S., Population-based incremental learning, Technical Report CMU-
CS-94-163. Carnegie Mellon University, 1994.
[6] Brighton, H., and Mellish, C., Advances in instance selection for instance-
based learning algorithms, Data Mining and Knowledge Discovery , 6, 153-
72, 2002.
[7] Brodley, C. E., Addressing the selective superiority problem: Automatic
algorithm/model class selection, in Proc. 10th International Machine
Learning Conference , Amherst, MA, 17-24, 1993.
[8] Chapman, P., Clinton, J., Khabaza, T., Reinart, T., and Wirth, R., The
CRISP-DM Process Model. www.crisp-dm.org , 1999.
[9] Cover, T. M., and Hart, P. E., Nearest neighbor pattern classification, IEEE
Transactions on Information Theory , 13, 21-7, 1967.
[10] Dasarathy, B. V., Nearest Neighbor (NN) Norms: NN Pattern Classification
Techniques , IEEE Computer Society Press, Los Alamitos, CA, 1991.
[11] Devijver, P. A., and Kittler, J., On the edited nearest neighbor rule, in Proc.
5th Internat. Conf. on Pattern Recognition, 72-80, 1980.
[12] Eshelman, L. J., The CHC adaptive search algorithm: How to have safe
search when engaging in nontraditional genetic recombination, in
Foundations of Genetic Algorithms-1 , Rawlins, G. J. E., (ed.), Morgan
Kauffman, 265-83, 1991.
[13] Fogel, D. B., Evolutionary Computation: Toward a New Philosophy of
Machine Intelligence , IEEE Press: Piscataway, 1995.
[14] Frank, E., and Witten, I. H., Making better use of global discretization, in
Proc. 16th International Conference on Machine Learning , Bratko, I., and
Dzeroski, S., (eds.), Morgan Kaufmann, 115-23, 1999.