A cooperative coevolutionary algorithm for instance selection for instance-based learning

Machine Learning

Volumn 78, Issue 3, 2010, Pages 381-420

  García Pedrajas, Nicolás ^a   Del Castillo, Juan Antonio Romero ^a   Ortiz Boyer, Domingo ^a  

^a UNIVERSITY OF CÓRDOBA   (Spain)

Author keywords

Evolutionary algorithms; Instance selection

Indexed keywords

ARTIFICIAL INTELLIGENCE; SOFTWARE ENGINEERING;

CLASSIFICATION ACCURACY; CLASSIFIER ALGORITHMS; CO-EVOLUTIONARY ALGORITHM; COOPERATIVE CO-EVOLUTION; COOPERATIVE EVOLUTIONARY; INSTANCE SELECTION; INSTANCE SELECTION FOR INSTANCE-BASED LEARNING; UCI MACHINE LEARNING REPOSITORY;

EVOLUTIONARY ALGORITHMS;

EID: 76549132784     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-009-5161-3     Document Type: Article

References (61)

1. Aha, D. W., Kibler, D., & Albert, M. K. (1991). Instance-based learning algorithms. Machine Learning, 6, 37-66. (Pubitemid 21727227)
2. Anderson, T. W. (1984). An introduction to multivariate statistical analysis (2nd edn.). Wiley series in probability and mathematical statistics. New York: Wiley.
3. Baluja, S. (1994). Population-based incremental learning (Technical Report CMU-CS-94-163). Carnegie Mellon University, Pittsburgh.
4. Barandela, R., Ferri, F. J., & Sánchez, J. S. (2005). Decision boundary preserving prototype selection for nearest neighbor classification. International Journal of Pattern Recognition and Artificial Intelligence, 19(6), 787-806. (Pubitemid 41374104)
5. Blum, A., & Langley, P. (1997). Selection of relevant features and examples in machine learning. Artificial Intelligence, 97, 245-271. (Pubitemid 127401106)
6. Bongard, J., & Lipson, H. (2005a). Active coevolutionary learning of deterministic finite automata. Journal of Machine Learning Research, 6, 1651-1678.
7. Bongard, J. C., & Lipson, H. (2005b). Nonlinear system identification using coevolution of models and tests. IEEE Transactions on Evolutionary Computation, 9(4), 361-384. (Pubitemid 41226911)
8. Brighton, H., & Mellish, C. (2002). Advances in instance selection for instance-based learning algorithms. Data Mining and Knowledge Discovery, 6, 153-172. (Pubitemid 37113870)
9. Brodley, C. E. (1995). Recursive automatic bias selection for classifier construction. Machine Learning, 20(1/2), 63-94.
10. Cano, J. R., Herrera, F., & Lozano, M. (2003). Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study. IEEE Transactions on Evolutionary Computation, 7(6), 561-575.
11. Cano, J. R., Herrera, F., & Lozano, M. (2005). Stratification for scaling up evolutionary prototype selection. Pattern Recognition Letters, 26(7), 953-963. (Pubitemid 40538755)
12. Cano, J. R., Herrera, F., & Lozano, M. (2007). Evolutionary stratified training set selection for extracting classification rules with trade off precision-interpretability. Data & Knowledge Engineering, 60(1), 90-108. (Pubitemid 46053591)
13. Chaudhuri, S., Motwani, R., & Narasayya, V. (1998). Random sampling for histogram construction: how much is enough? In L. Haas & A. Tiwary (Eds.), Proceedings of ACM SIGMOD, international conference on management of data (pp. 436-447). New York, USA. (Pubitemid 128655989)
14. Chellapilla, K., & Fogel, D. B. (1999). Evolving neural networks to play checkers without relying on expert knowledge. IEEE Transactions on Neural Networks, 10(6), 1382-1391. (Pubitemid 30536588)
15. Chen, J. H., Chen, H.M., & Ho, S. Y. (2005). Design of nearest neighbor classifiers: multi-objective approach. International Journal of Approximate Reasoning, 40(1-2), 3-22.
16. Cochran, W. (1977). Sampling techniques. New York: Wiley.
17. Cover, T. M., & Thomas, J. A. (1991). Elements of information theory. Wiley series in telecommunication. New York: Wiley.
18. Demšar, J. (2006). Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7, 1-30. (Pubitemid 43022939)
19. Dietterich, T. G. (1998). Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10(7), 1895-1923. (Pubitemid 128463689)
20. Dietterich, T. G. (2000). An experimental comparison of threemethods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning, 40, 139-157.
21. Eshelman, L. J. (1990). The CHC adaptive search algorithm: how to have safe search when engaging in nontraditional genetic recombination. San Mateo: Morgan Kauffman.
22. García-Pedrajas, N., & Fyfe, C. (2007) Immune network based ensembles. In Neurocomputing (pp. 1155-1166). (Pubitemid 46336774)
23. García-Pedrajas, N., & Ortiz-Boyer, D. (2007). A cooperative constructive method for neural networks for pattern recognition. Pattern Recognition, 40(1), 80-99.
24. García-Pedrajas, N., Hervás-Martínez, C., & Muñoz-Pérez, J. (2002). Multiobjective cooperative coevolution of artificial neural networks (multi-objective cooperative networks). Neural Networks, 15(10), 1255-1274.
25. García-Pedrajas, N., Hervás-Martínez, C., & Ortiz-Boyer, D. (2005). Cooperative coevolution of artificial neural network ensembles for pattern classification. IEEE Transactions on Evolutionary Computation, 9(3), 271-302. (Pubitemid 40871133)
26. Gates, G. W. (1972). The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 18(3), 431-433.
27. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley.
28. Grefenstette, J. J. (1987). Incorporating problem specific knowledge into genetic algorithms. In L. Davis (Ed.), Genetic algorithms and simulated annealing (pp. 42-60). San Mateo: Morgan Kaufmann.
29. Hettich, S., Blake, C., & Merz, C. (1998). UCI Repository of machine learning databases. http://www.ics.uci.edu/∼mlearn/MLRepository.html.
30. Hillis, W. D. (1991). Co-evolving parasites improves simulated evolution as an optimization procedure. In C. G. Langton, C. Taylor, J. D. Farmer, & S. Rasmussen (Eds.), In Artificial Life II (pp. 313-384).
31. Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press.
32. Hussain, F., Liu, H., Tan, C., & Dash, M. (1999). Discretization: an enabling technique (Technical Report TRC6/99). School of Computing, National University of Singapore.
33. Ishibuchi, H., & Nakashima, T. (2000). Pattern and feature selection by genetic algorithms in nearest neighbor classification. Journal of Advanced Computational Intelligence and Intelligent Informatics, 4(2), 138-145.
34. Kivinen, J., & Mannila, H. (1994). The power of sampling in knowledge discovery. In Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (pp. 77-85). Minneapolis, Minnesota, USA.
35. Kuncheva, L. (1995). Editing for the k-nearest neighbors rule by a genetic algorithm. Pattern Recognition Letters, 16, 809-814.
36. Leung, Y. W., & Wang, Y. P. (2001). An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Transactions on Evolutionary Computation, 5(1), 41-53.
37. Li, J., Manry, M. T., Yu, C., & Wilson, D. R. (2005). Prototype classifier design with pruning. International Journal of Artificial Intelligence Tools, 14(1-2), 261-280.
38. Liu, H., & Motoda, H. (1998). Feature selection for knowledge discovery and data mining. Norwell: Kluwer.
39. Liu, H., & Motoda, H. (2002). On issues of instance selection. Data Mining and Knowledge Discovery, 6, 115-130. (Pubitemid 37113868)
40. Louis, S. J., & Li, G. (1997). Combining robot control strategies using genetic algorithms with memory. In Lecture notes in computer science: Vol. 1213. Evolutionary programming VI (pp. 431-442). Berlin: Springer. (Pubitemid 127053276)
41. Michalewicz, Z. (1994). Genetic algorithms+Data structures=Evolution programs. New York: Springer.
42. Moriarty, D. E., & Miikkulainen, R. (1995). Discovering complex Othello strategies through evolutionary neural networks. Connection Science, 7(3), 195-209.
43. Moriarty, D. E., & Miikkulainen, R. (1996). Efficient reinforcement learning through symbiotic evolution. Machine Learning, 22, 11-32. (Pubitemid 126724361)
44. Potter, M., & De Jong, K. A. (1994). A coopetative coevolutionary approach to function optimization. In Proceedings of the third conference on parallel problem solving from nature (pp. 249-257).
45. Potter, M. A., & De Jong, K. A. (2000). Cooperative coevolution: an architecture for evolving coadapted subcomponents. Evolutionary Computation, 8(1), 1-29.
46. Provost, F. J., & Kolluri, V. (1999). A survey of methods for scaling up inductive learning algorithms. Data Mining and Knowledge Discovery, 2, 131-169.
47. Reeves, C. R., & Bush, D. R. (2001). Using genetic algorithms for training data selection in RBF networks. In H. Liu & H. Motoda (Eds.), Instances selection and construction for data mining (pp. 339-356). Norwell: Kluwer.
48. Ritter, G. L., Woodruff, H. B., Lowry, S. R., & Isenhour, T. L. (1975). An algorithm for selective nearest neighbor decision rule. IEEE Transactions on Information Theory, 21(6), 665-669.
49. Rosin, C. D., & Belew, R. K. (1997). New methods for competitive coevolution. Evolutionary Computation, 5(1), 1-29. (Pubitemid 127717836)
50. Smith, P. (1998). Into statistics. Singapore: Springer.
51. Smyth, B., & Keane, M. T. (1995). Remembering to forget. In C. S. Mellish (Ed.), Proceedings of the fourteenth international conference on artificial intelligence (Vol. 1. pp. 377-382).
52. Son, S. H., & Kim, J. Y. (2006). Data reduction for instance-based learning using entropy-based partitioning. In Lecture notes in computer science: Vol. 3982. Proceedings of the international conference on computational science and its applications-ICCSA 2006 (pp. 590-599). Berlin: Springer.
53. Syswerda, G. (1991). A study of reproduction in generational and steady-state genetic algorithms. In G. Rawlins (Ed.), Foundations of genetic algorithms (pp. 94-101). San Mateo: Morgan Kaufmann.
54. Tomek, I. (1976). Two modifications of CNN. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics, SMC-6, 769-772.
55. Whitley, D. (1989). The GENITOR algorithm and selective pressure. In M. K. Publishers (Ed.), Proc. 3rd international conf. on genetic algorithms (pp. 116-121). Los Altos, CA.
56. Whitley, D., & Kauth, J. (1988). GENITOR: a different genetic algorithm. In Proceedings of the Rocky mountain conference on artificial intelligence (pp. 118-130). Denver, CO.
57. Whitley, D., & Starkweather, T. (1990). GENITOR II: a distributed genetic algorithm. Journal of Experimental Theoretical Artificial Intelligence, 2, 189-214.
58. Wilson, D. L. (1972). Asymptotic properties of nearest neighbor rules using edited data. IEEE Transactions on Systems, Man, and Cybernetics, 2(3), 408-421.
59. Wilson, D. R., & Martinez, A. R. (1997). Instance pruning techniques. In D. Fisher (Ed.), Proceedings of the fourteenth international conference on machine learning (pp. 404-411). San Francisco, CA, USA.
60. Wilson, D. R., & Martinez, T. R. (2000). Reduction techniques for instance-based learning algorithms. Machine Learning, 38, 257-286. (Pubitemid 30572450)
61. Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C. M., & Grunert, V. (2003). Performance assesment of multiobjective optimizers: an analysis and review. IEEE Transactions on Evolutionary Computation, 7(2), 117-132.