Classification as clustering: A pareto cooperative-competitive GP approach

Evolutionary Computation

Volumn 19, Issue 1, 2011, Pages 137-166

  McIntyre, Andrew R ^a   Heywood, Malcolm I ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Classification; Coevolution; Genetic programming; Pareto multi objective optimization; Problem decomposition

Indexed keywords

CLASSIFICATION; CLASSIFICATION PERFORMANCE; CLASSIFICATION TASKS; CO-EVOLUTIONARY; COEVOLUTION; COMPETITIVE COEVOLUTION; DATA SETS; EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION; GAUSSIANS; MODEL COMPLEXITY; MULTI OBJECTIVE; NATURAL ENVIRONMENTS; PARETO MULTI-OBJECTIVE OPTIMIZATION; POPULATION-BASED ALGORITHM; PROBLEM DECOMPOSITION; SVM CLASSIFIERS; TEAM MEMBERS;

CLASSIFICATION (OF INFORMATION); GENETIC PROGRAMMING; MEMBERSHIP FUNCTIONS; PARETO PRINCIPLE;

MULTIOBJECTIVE OPTIMIZATION;

ARTICLE; ARTIFICIAL INTELLIGENCE; CLASSIFICATION; CLUSTER ANALYSIS; HUMAN; METHODOLOGY;

ARTIFICIAL INTELLIGENCE; CLASSIFICATION; CLUSTER ANALYSIS; HUMANS;

EID: 79951561922     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/EVCO_a_00016     Document Type: Article

References (56)

1. Badran, K. M. S., and Rockett, P. I. (2007). The roles of diversity preservation and mutation in preventing population collapse in multiobjective genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Vol. 2, pp. 1551-1557.
2. Badran, K. M. S., and Rockett, P. I. (2008). Integrating categorical variables with multiobjective genetic programming for classifier construction. In Proceedings of the European Conference on Genetic Programming (EuroGP), Lecture Notes in Computer Science, Vol. 4971 (pp. 301-311). Berlin: Springer.
3. Bottou, L., Chapelle, O., DeCoste, D., and Weston, J. (Eds.). (2007). Large-scale kernel machines. Cambridge, MA: MIT Press.
4. Bremeier, M., and Banzhaf W. (2001). Evolving teams of predictors with linear genetic programming. Genetic Programming and Evolvable Machines, 2(4):381-408.
5. Cartlidge, J., and Bullock, S. (2002). Learning lessons from the common cold: How reducing parasite virulence improves coevolutionary optimization. In IEEE Congress on Evolutionary Computation, pp. 1420-1425.
6. Chandra, A., Chen, H., and Yao, X. (2006). Trade-off between diversity and accuracy in ensemble generation (Chap. 19, pp. 429-464). In Y. Jin (Ed.), Multi-objective machine learning, Vol. 16 of Studies in Computational Intelligence. Berlin: Springer-Verlag.
7. Chang, C.-C., and Lin, C.-J. (2001). LIBSVM: A library for support vector machines. Retrieved from http://www.csie.ntu.edu.tw/cjlin/libsvm
8. Chapelle, O., DeCoste, D., and Keerthi, S. (2006). Building support vector machines with reduced classifier complexity. Journal of Machine Learning Research, 7:1493-1515.
9. Chiu, S. L. (1994). Fuzzy model identification based on cluster estimation. Journal of Intelligent and Fuzzy Systems, 2:267-278.
10. Cohn, D., Atlas, L., and Ladner, R. (1994). Improved generalization with active learning. Machine Learning, 15:201-221.
11. de Jong, E. D. (2007). A monotonic archive for Pareto-coevolution. Evolutionary Computation, 15(1):61-94.
12. de Jong, E. D., and Pollack, J. B. (2004). Ideal evaluation from coevolution. Evolutionary Computation, 12(2):159-192.
13. Deb, K., Pratap, A., Agarwal, S., and Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm. IEEE Transactions on Evolutionary Computation, 6(2):182-197.
14. Doucette, J., and Heywood M. I. (2008). GP classification under imbalanced data sets: Active subsampling and AUC approximation. In European Conference on Genetic Programming (EuroGP). Lecture Notes in Computer Science, Vol. 4971 (pp. 266-277). Berlin: Springer.
15. Doucette, J., Lichodzijewski, P., and Heywood, M. I. (2009). Evolving coevolutionary classifiers under large attribute spaces. In R. Riolo, U.-M. O'Rielly, and T. McConaghy (Eds.), Genetic programming theory and practice, Vol. VII (pp. 37-54). Berlin: Springer.
16. Fan, R., Chen, P., and Lin, C. (2005). Working set selection using second order information for training support vector machines. Journal of Machine Learning Research, 6:1889-1918.
17. Ficici, S. G., and Pollack, J. B. (2001). Pareto optimality in coevolutionary learning. In European Conference on Artificial Life, pp. 286-297.
18. Fonseca, C. M., and Fleming, P. J. (1993). Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In Proceedings of the International Conference on Genetic Algorithms, pp. 416-423.
19. Gathercole, C., and Ross, P. (1994). Dynamic training subset selection for supervised learning in genetic programming. In Parallel problem solving from nature (PPSN III). Lecture Notes in Computer Science, Vol. 866 (pp. 312-321). Berlin: Springer.
20. Harper, R., and Blair, A. (2005). A structure preserving crossover in grammatical evolution. In IEEE Congress on Evolutionary Computation, Vol. 3, pp. 2537-2544.
21. Hettich, S., and Bay, S. D. (1999). The UCI KDD archive. Retrieved from http://kdd.ics.uci.edu/
22. Hillis, W. D. (1990). Coevolving parasites improve simulated evolution as an optimization procedure. Physica, D 42:228-234.
23. Hsu, C., and Lin, C. (2002). A comparison of methods for multiclass support vector machines. IEEE Transactions on Neural Networks, 13(2):415-425.
24. Iba, H. (1999). Bagging, boosting, and bloating in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 1053-1060.
25. Imamura, K., Soule, T., Heckendorn, R. B., and Foster, J. A. (2003). Behavioral diversity and a probabilistically optimalGP ensemble. Genetic Programming and EvolvableMachines, 4(3):235-253.
26. Jin, Y., (Ed.). (2006). Multi-objective machine learning, Vol. 16 of Studies in computational intelligence. Berlin: Springer-Verlag.
27. Kothari, R., and Jain,V. (2003). Learning fromlabeled and unlabeled data using a minimal number of queries. IEEE Transactions on Neural Networks, 14(6):1496-1505.
28. Kumar, R., and Rockett, P. (2002). Improved sampling of the Pareto-front in multiobjective genetic optimizations by steady-state evolution. Evolutionary Computation, 10(3):283-314.
29. Laumanns, M., Thiele, L., Deb, K., and Zitzler, E. (2002). Combining convergence and diversity in evolutionary multi-objective optimization. Evolutionary Computation, 10(3):263-282.
30. Lemczyk, M. (2006). Pareto-coevolutionary genetic programming classifier. Master's thesis, Dalhousie University, Faculty of Computer Science. Retrieved from http://www.cs.dal.ca/mheywood/Thesis
31. Lemczyk, M., and Heywood, M. I. (2007). Training binary GP classifiers efficiently: A Paretocoevolutionary approach. In Proceedings of the European Conference on Genetic Programming (EuroGP). Lecture Notes in Computer Science, Vol. 4445 (pp. 229-240). Berlin: Springer.
32. Lichodzijewski, P., and Heywood, M. I. (2007). Pareto-coevolutionary genetic programming for problem decomposition in multi-class classification. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Vol. 1, pp. 464-471.
33. Liu, Y., Yao, X., and Higuchi, T. (2000). Evolutionary ensembles with negative correlation learning. IEEE Transactions on Evolutionary Computation, 4(4):380-387.
34. Loveard, T., and Ciesielski, V. (2001). Representing classification problems in genetic programming. In Proceedings of the Congress on Evolutionary Computation, Vol. 2, pp. 1070-1077.
35. Markou, M., and Singh, S. (2003). Novelty detection: A review. Part 2: Neural network based approaches. Signal Processing, 83:2499-2521.
36. McIntyre, A. R. (2007). Novelty detection + coevolution = automatic problem decomposition: A framework for scalable genetic programming classifiers. PhD thesis, Dalhousie University, Faculty of Computer Science. Retrieved from http://www.cs.dal.ca/mheywood/Thesis
37. McIntyre, A. R., and Heywood, M. I. (2006). MOGE: GP classification problem decomposition using multi-objective optimization. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 863-870.
38. McIntyre, A. R., and Heywood, M. I. (2007). Multi-objective competitive coevolution for efficient GP classifier problem decomposition. In IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 1930-1937.
39. McIntyre, A. R., and Heywood, M. I. (2008a). Cooperative problem decomposition in Pareto competitive classifier models of coevolution. In European Conference on Genetic Programming (EuroGP). Lecture Notes in Computer Science, Vol. 4971 (pp. 289-300). Berlin: Springer.
40. McIntyre, A. R., and Heywood, M. I. (2008b). Pareto cooperative-competitive genetic programming: Aclassification benchmarking study. In R. Riolo, T. Soule, and B.Worzel (Eds.), Genetic programming theory and practice, Vol. VI, Chap. 4 (pp. 43-60). Berlin: Springer.
41. Newman, D. J., Hettich, S., Blake, C. L., and Merz, C. J. (1998). UCI machine learning repository. Retrieved from http://mlearn.ics.uci.edu/MLRepository.html
42. Noble, J., and Watson, R. (2001). Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selection. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 493-500.
43. O'Neill, M., and Ryan, C. (2003). Grammatical evolution: Evolutionary automatic programming in an arbitrary language, Vol. 4 of Genetic programming. Berlin: Springer-Verlag.
44. Parrott, D., Xiaodong, L., and Ciesielski, V. (2005).Multi-objective techniques in genetic programming. In IEEE Congress on Evolutionary Computation, Vol. 2, pp. 1141-1148.
45. Platt, J. C. (1999). Fast training of support vector machines using sequential minimal optimization (pp. 185-208). Cambridge, MA: MIT Press.
46. Sarasamma, S. T., Zhu, Q. A., and Huff, J. (2005). Hierarchical Kohonen net for anomaly detection in network security. IEEE Transactions on Systems, Man, and Cybernetics: Part B, Cybernetics, 35(2):302-312.
47. Sokolova, M., Japkowicz, N., and Szpakowicz, S. (2006). Beyond accuracy, F-score and ROC: A family of discriminant measures for performance evaluation. In Evaluation Methods for Machine Learning (AAAI workshop), pp. 24-29.
48. Soule, T. (2000). Heterogeneity and specialization in evolving teams. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 778-785.
49. Steinwart, I. (2003). Sparseness of support vector machines. Journal of Machine Learning Research, 4:1071-1105.
50. Thomason, R., and Soule, T. (2007). Novel ways of improving cooperation and performance in ensemble classifiers. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 1708-1715.
51. Watson, R., and Pollack, J. (2001). Coevolutionary dynamics in a minimal substrate. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 702-709.
52. Weiss, G. M., and Provost, F. (2003). Learning when training data are costly: The effect of class distribution on tree induction. Journal of Artificial Intelligence Research, 19:315-345.
53. Yo, T.-S., and de Jong, E. D. (2007). A comparison of evaluation methods in coevolution. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), Vol. 1, pp. 479-486.
54. Zhang, M., and Smart, W. (2006). Using Gaussian distribution to construct fitness functions in genetic programming for multiclass object classification. Pattern Recognition Letters, 27(11):1266-1274.
55. Zhang, Y., and Rockett, P. I. (2006). Feature extraction using multi-objective genetic programming, Chap. 4, pp. 75-99. In Y. Jin (Ed.), Multi-objective machine learning, Vol. 16 of Studies in computational intelligence. Berlin: Springer-Verlag.
56. Zitzler, E., and Thiele, L. (1999). Multiobjective evolutionary algorithms: A comprehensive case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271.