Using evolutionary algorithms as instance selection for data reduction in KDD: An experimental study

IEEE Transactions on Evolutionary Computation

Volumn 7, Issue 6, 2003, Pages 561-575

  Cano, José Ramón ^a   Herrera, Francisco ^b   Lozano, Manuel ^b  

^a UNIVERSITY OF HUELVA   (Spain)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

Data mining (DM); Data reduction; Evolutionary algorithms (EAs); Instance selection; Knowledge discovery

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; INTERNET; KNOWLEDGE REPRESENTATION; LEARNING ALGORITHMS;

ACTIVE LEARNING; INSTANCE SELECTION; KNOWLEDGE DISCOVERY IN DATABASES; PROTOTYPE SELECTION;

EVOLUTIONARY ALGORITHMS;

EID: 0347763609     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2003.819265     Document Type: Article

References (36)

1. P. Adriaans and D. Zantinge, Data Mining. Reading, MA: Addison-Wesley, 1996.
2. D. W. Aha, D. Kibbler, and M. K. Albert, "Instance-based learning algorithms," Mach. Learn., vol. 6, pp. 37-66, 1991.
3. T. Back, D. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation. London, U.K.: Oxford Univ. Press, 1997.
4. S. Baluja, "Population-based incremental learning," Carnegie Mellon Univ., Pittsburgh, PA, CMU-CS-94-163, 1994.
5. H. Brighton and C. Mellish, "Identifying competence-critical instances for instance-based learners," in Instance Selection and Construction for Data Mining, H. Liu and and H. Motoda, Eds. Norwell, MA: Kluwer, 2001, pp. 77-94.
6. ____, "Advances in instance selection for instance-based learning algorithms," Data Mining and Knowl. Dis., vol. 6, pp. 153-172, 2002.
7. C. E. Broadley, "Addressing the selective superiority problem: Automatic algorithm/model class selection," in Proc. 10th Int. Machine Learning Conf., Amherst, MA, 1993, pp. 17-24.
8. P. Chapman, J. Clinton, T. Khabaza, T. Reinart, and R. Wirth. (1999) The CRISP-DM Process Model. [Online]. Available: www.cripdm.org/pub-paper.pdf
9. P. A. Devijver and J. Kittler, Pattern Recognition: A Statistical Approach. Englewood Cliffs, NJ: Prentice-Hall, 1982.
10. L. J. Eshelman, "The adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination," in Foundations of Genetic Algorithms-1, G. J. E. Rawlins, Ed. San Mateo, CA: Morgan Kauffman, 1991, pp. 265-283.
11. F. Esposito, D. Malerba, and G. Semeraro, "A comparative analysis of methods for pruning decision trees," IEEE Trans. Pattern Anal. Machine Intell., vol. 19, no. 5, pp. 476-491, 1997.
12. E. Frank and I. H. Witten, "Making better use of global discretization," in Proc. 16th Int. Conf. Machine Learning, I. Bratko and S. Dzeroski, Eds., 1999, pp. 115-123.
13. G. W. Gates, "The reduced nearest neighbor rule," IEEE Trans. Inform. Theory, vol. IT-14, pp. 431-433, May 1972.
14. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
15. P. E. Hart, "The condensed nearest neighbor rule," IEEE Trans. Inform. Theory, vol. IT-14, pp. 515-516, May 1968.
16. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Michigan Press, 1975.
17. L. Kuncheva, "Editing for the k-Nearest neighbors rule by a genetic algorithm," Pattern Recognit. Lett., vol. 16, pp. 809-814, 1995.
18. D. Kibbler and D. W. Aha, "Learning representative exemplars of concepts: An initial case of study," in Proc. 4th Int. Workshop Machine Learning, 1987, pp. 24-30.
19. H. Liu and R. Setiono, "Chi2: Feature selection and discretization of numeric attributes," in Proc. 7th IEEE Int. Conf. Tools Artificial Intelligence, 1995, pp. 388-391.
20. H. Liu and H. Motoda, Feature Selection for Knowledge Discovery and Data Mining. Norwell, MA: Kluwer, 1998.
21. ____, "Data reduction via instance selection," in Instance Selection and Construction for Data Mining, H. Liu and H. Motoda, Eds. Norwell, MA: Kluwer, 2001, pp. 3-20.
22. ____, "On issues of instance selection," Data Mining and Knowl. Dis., vol. 6, pp. 115-130, 2002.
23. D. G. Lowe, "Similarity metric learning for a variable-kernel classifier," Neural Comput., vol. 7, no. 1, pp. 72-85, 1995.
24. J.R. Quinlan, C4.5: Programs for Machine Learning. San Mateo, CA: Morgan Kaufmann, 1993.
25. C. R. Reeves and D. R. Bush, "Using genetic algorithms for training data selection in RBF networks," in Instance Selection and Construction for Data Mining, H. Liu and H. Motoda, Eds. Norwel, MA: Kluwer, 2001, pp. 339-356.
26. T. Reinartz, "A unifying view on instance selection," Data Mining and Knowl. Dis., vol. 6, pp. 191-210, 2002.
27. J. Reunanen, "Overfitting in making comparisons between variable selection methods," J. Mach. Learn. Res., vol.3, pp. 1371-1382, 2003.
28. S. R. Safavian and D. Landgrebe, "A survey of decision tree classifier methodology," IEEE Trans. Systems, Man, Cybern., vol. 21, pp. 660-674, May-June, 1991.
29. J. G. Shanahan, Soft Computing for Knowledge Discovery. Norwell, MA: Kluwer, 2000.
30. D. B. Skalak, "Prototype and feature selection by sampling and random mutation hill climbing algorithms," in Proc. 11th Int. Conf. Machine Learning, 1994, pp. 293-301.
31. D. L. Wilson, "Asymptotic properties of nearest neighbor rules using edited data," IEEE Trans. Systems Man, Cybern., vol. SMC-2, pp. 408-421, 1972.
32. D. R. Wilson and T. R. Martinez, "Instance pruning techniques," in Proc. 14th Int. Conf. Machine Learning, 1997, pp. 403-411.
33. ____, "Reduction techniques for instance-based learning algorithms," Mach. Learn., vol. 38, pp. 257-268, 2000.
34. I. H. Witten and E. Frank, Data Mining: Practical Machine Learning Tools and Techniques With Java Implementations. San Mateo, CA: Morgan, Kaufmann, 2000.
35. D. Whitley, "The GENITOR algorithm and selective preasure: Why rank based allocation of reproductive trials is best," in Proc. 3rd Int. Conf. GAs, Schaffer, Ed., 1989, pp. 116-121.
36. J. Zhang, "Selecting typical instances in instance-based learning," in Proc. 9th Int. Conf. Machine Learning, D. Sleeman and P. Edwards, Eds., 1992, pp. 470-479.