Automated global structure extraction for effective local building block processing in XCS

Evolutionary Computation

Volumn 14, Issue 3, 2006, Pages 345-380

  Butz, Martin V ^a   Pelikan, Martin ^b   Llorà, Xavier ^c   Goldberg, David E ^c  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Bayesian optimization algorithm; Building block processing; Decomposable classification problems; Estimation of distribution algorithms; Extended compact GA; Learning classifier systems; Online learning; XCS

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; BAYES THEOREM; BIOLOGICAL MODEL; BIOLOGY; CLASSIFICATION; EPIDEMIOLOGY; METHODOLOGY; MUTATION; POPULATION GENETICS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BAYES THEOREM; CLASSIFICATION; COMPUTATIONAL BIOLOGY; GENETICS, POPULATION; MODELS, GENETIC; MUTATION; SAMPLING STUDIES;

EID: 33750578932     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2006.14.3.345     Document Type: Article

References (59)

1. Ahn, C. W., Ramakrishna, R. S., & Goldberg, G. (2004). Real-coded Bayesian optimization algorithm: Bringing the strength of BOA into the continuous world. Genetic and Evolutionary Computation Conference (GECCO-2004), 3102, 840-851.
2. Booker, L. B., Goldberg, D. E., & Holland, J. H. (1989). Classifier systems and genetic algorithms. Artificial Intelligence, 40, 235-282.
3. Bosman, P. A., & Thierens, D. (2000). Mixed IDEAs (Utrecht University Technical Report UU-CS-2000-45). Utrecht, Netherlands: Utrecht University.
4. Buntine, W. L. (1991). Theory refinement of Bayesian networks. Proceedings of the Uncertainty in Artificial Intelligence (UAI-91), 52-60.
5. Butz, M. V. (2004a). Hierarchical classification problems demand effective building block identification and processing in less (IlliGAL report 2004017). University of Illinois at Urbana-Champaign: Illinois Genetic Algorithms Laboratory.
6. Butz, M. V. (2004b). Rule-based evolutionary online learning systems: Learning bounds, classification, and prediction. Doctoral dissertation, University of Illinois at UrbanaChampaign, Urbana, IL.
7. Butz, M. V. (2006). Rule-based evolutionary online learning systems: A principled approach to LCS analysis and design. Studies in Fuzziness and Soft Computing. Berlin Heidelberg: Springer-Verlag.
8. Butz, M. V., Goldberg, D. E., & Lanzi, P. L. (2004). Bounding learning time in XCS. Proceedings of the Sixth Genetic and Evolutionary Computation Conference (GECCO2004): Part II, 739-750.
9. Butz, M. V., Goldberg, D. E., Lanzi, P. L., & Sastry, K. (2004). Bounding the population size to ensure niche support in XCS (IlliGAL report 2004033). University of Illinois at Urbana-Champaign: Illinois Genetic Algorithms Laboratory.
10. Butz, M. V., Goldberg, D. E., & Stolzmann, W. (2002). The anticipatory classifier system and genetic generalization. Natural Computing, 1, 427-467.
11. Butz, M. V., Goldberg, D. E., & Tharakunnel, K. (2003). Analysis and improvement of fitness exploitation in XCS: Bounding models, tournament selection, and bilateral accuracy. Evolutionary Computation, 11, 239-277.
12. Butz, M. V., Kovacs, T., Lanzi, P. L., & Wilson, S. W. (2001). How XCS evolves accurate classifiers. Proceedings of the Third Genetic and Evolutionary Computation Conference (GECCO-2001), 927-934.
13. Butz, M. V., Kovacs, T., Lanzi, P. L., & Wilson, S. W. (2004). Toward a theory of generalization and learning in XCS. IEEE Transactions on Evolutionary Computation, 8, 28-46.
14. Butz, M. V., & Pelikan, M. (2001). Analyzing the evolutionary pressures in XCS. Proceedings of the Third Genetic and Evolutionary Computation Conference (GECCO2001), 935-942.
15. Butz, M. V., Sastry, K., & Goldberg, D. E. (2003). Tournament selection in XCS. Proceedings of the Fifth Genetic and Evolutionary Computation Conference (GECCO-2003,), 1857-1869.
16. Butz, M. V., & Wilson, S. W. (2001). An algorithmic description of XCS. In Lanzi, P. L., Stolzmann, W., & Wilson, S. W. (Eds.), Advances in learning classifier systems: Third international workshop, IWLCS 2000 (LNAI1996) (pp. 253-272). Berlin Heidelberg: Springer-Verlag.
17. Chickering, D. M., Heckerman, D., & Meek, C. (1997). A Bayesian approach to learning Bayesian networks with local structure (Technical Report MSR-TR-97-07). Redmond, WA: Microsoft Research.
18. Cooper, G. F., & Herskovits, E. H. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9, 309-347.
19. De Jong, K. A., & Spears, W. M. (1991). Learning concept classification rules using genetic algorithms. IJ/CAI-91 Proceedings of the Twelfth International Conference on Artificial Intelligence, 651-656.
20. Friedman, N., & Goldszmidt, M. (1999). Learning Bayesian networks with local structure. In Jordan, M. I. (Ed.), Graphical models (pp. 421-459). Cambridge, MA: MIT Press.
21. Gérard, P., & Sigaud, O. (2003). Designing efficient exploration with MACS: Modules and function approximation. Proceedings of the Fifth Genetic and Evolutionary Computation Conference (GECCO-2003), 1882-1893.
22. Gibson, J. J. (1979). The ecological approach to visual perception. Mahwah, NJ: Lawrence Erlbaum Associates.
23. Goldberg, D. E. (2002). The design of innovation: Lessons from and for competent genetic algorithms. Boston, MA: Kluwer Academic Publishers.
24. Harik, G. (1999). Linkage learning via probabilistic modeling in the ECGA (IlliGAL report 99010). University of Illinois at Urbana-Champaign: Illinois Genetic Algorithms Laboratory.
25. Harik, G. R., Cantú-Paz, E., Goldberg, D. E., & Miller, B. L. (1997). The gambler's ruin problem, genetic algorithms, and the sizing of populations. Proceedings of the International Conference on Evolutionary Computation (ICEC-97), 7-12. Also IlliGAL Report No. 96004.
26. Heckerman, D., Geiger, D., & Chickering, D. M. (1994). Learning Bayesian networks: The combination of knowledge and statistical data (Technical Report MSR-TR-94-09). Redmond, WA: Microsoft Research.
27. Henrion, M. (1988). Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In Lemmer, J. F., & Kanal, L. N. (Eds.), Uncertainty in Artificial Intelligence (pp. 149-163). Amsterdam, London, New York: Elsevier.
28. Holland, J. H. (1975). Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press. Second edition, 1992.
29. Holland, J. H., & Reitman, J. S. (1978). Cognitive systems based on adaptive algorithms. In Waterman, D. A., & Hayes-Roth, F. (Eds.), Pattern directed inference systems (pp. 313-329). New York: Academic Press.
30. Howard, R. A., & Matheson, J. E. (1981). Influence diagrams. In Howard, R. A., & Matheson, J. E. (Eds.), Readings on the principles and applications of decision analysis, Volume II (pp. 721-762). Menlo Park, CA: Strategic Decisions Group.
31. Kovacs, T. (1996). Evolving optimal populations with XCS classifier systems. Master's thesis, School of Computer Science, University of Birmingham, Birmingham, U.K.
32. Kovacs, T. (1997). XCS classifier system reliably evolves accurate, complete, and minimal representations for boolean functions. In Roy, Chawdhry, & Pant (Eds.), Soft computing in engineering design and manufacturing (pp. 59-68). Springer-Verlag, London.
33. Kovacs, T. (1999). Deletion schemes for classifier systems. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), 329-336.
34. Larrañaga, P. (2002). A review on estimation of distribution algorithms. In Larrañaga, P., & Lozano, J. A. (Eds.), Estimation of Distribution Algorithms (Chapter 3, pp. 57-100). Boston, MA: Kluwer Academic Publishers.
35. Larrañaga, P., Etxeberria, R., Lozano, J. A., & Pena, J. M. (2000). Optimization in continuous domains by learning and simulation of Gaussian networks. In Wu, A. (Ed.), Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000) (pp. 201-204). San Fransisco, CA: Morgan Kaufmann.
36. Larrañaga, P., & Lozano, J. A. (Eds.) (2002). Estimation of distribution algorithms: A new tool for evolutionary computation. Boston, MA: Kluwer.
37. Lobo, F., & Harik, G. (1999). Extended compact genetic algorithm in C++ (IlliGAL report 99016). University of Illinois at Urbana-Champaign: Illinois Genetic Algorithms Laboratory.
38. Mitchell, T. M. (1997). Machine learning. Boston, MA: McGraw-Hill.
39. Mühlenbein, H. (1992b). How genetic algorithms really work: I.Mutation and Hillclimbing. In Männer, R., & Manderick, B. (Eds.), Parallel Problem Solving from Nature- PPSN II (pp. 15-25). North Holland.
40. Mühlenbein, H., & Schlierkamp-Voosen, D. (1993). Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization. Evolutionary Computation, 1(1), 25-49.
41. Mühlenbein, T. M., & Paas, G. (1996). From recombination of genes to the estimation of distributions: Binary parameters. In Voigt, H.-M. et al. (Eds.), Parallel Problem Solving from Nature IV, LNCS 1411 (pp. 178-187). Springer Verlag.
42. Neal, R. M. (1993). Probabilistic inference using Markov chain Monte Carlo methods (Technical Report CRG-TR-93-1). Dept. of Computer Science, University of Toronto.
43. Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. San Mateo, CA: Morgan Kaufmann.
44. Pelikan, M. (2001). Bayesian optimization algorithm, decision graphs, and Occam's razor. Proceedings of the Third Genetic and Evolutionary Computation Conference (GECCO-2001), 511-518.
45. Pelikan, M. (2002). Bayesian optimization algorithm: From single level to hierarchy. Doctoral dissertation, University of Illinois at Urbana-Champaign, Urbana, IL. Also IlliGAL Report No. 2002023.
46. Pelikan, M. (2004). Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer-Verlag. In press.
47. Pelikan, M., Goldberg, D. E., & Cantu-Paz, E. (1999). BOA: The Bayesian optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), 525-532.
48. Pelikan, M., Goldberg, D. E., & Lobo, F. (2002). A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 22(1), 5-20.
49. Pelikan, M., Goldberg, D. E., & Tsutsui, S. (2003). Getting the best of both worlds: Discrete and continuous genetic and evolutionary algorithms in concert. Information Sciences, 156(3-4), 36-45.
50. Rudnick, M. W. (1992). Genetic algorithms and fitness variance with application to automated design of artificial neural networks. Doctoral dissertation, Oregon Graduate Institute of Science & Technology, Beaverton, OR.
51. Sastry, K., & Goldberg, D. E. (2000). On extended compact genetic algorithm (IlliGAL report 2000026). University of Illinois at Urbana-Champaign: Illinois Genetic Algorithms Laboratory.
52. Simon, H. A. (1969). Sciences of the artificial. Cambridge, MA: MIT Press.
53. Thierens, D., & Goldberg, D. E. (1993). Mixing in genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, 38-45.
54. Thierens, D., Goldberg, D. E., & Pereira, A. G. (1998a). Domino convergence, drift, and the temporal-salience structure of problems. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence (pp. 535-540). New York, NY: IEEE Press.
55. Thierens, D., Goldberg, D. E., & Pereira, A. G. (1998b). Domino convergence, drift, and the temporal-salience structure of problems. Proceedings of the International Conference on Evolutionary Computation (ICEC-98), 535-540.
56. Wilson, S. W. (1995). Classifier fitness based on accuracy. Evolutionary Computation, 3(2), 149-175.
57. Wilson, S. W (1998). Generalization in the XCS classifier system. Genetic Programming 1998: Proceedings of the Third Annual Conference, 665-674.
58. Wilson, S. W. (2000). Get real! XCS with continuous-valued inputs. In Lanzi, P. L., Stolzmann, W., & Wilson, S. W. (Eds.), Learning classifier systems: From foundations to applications (LNAI1813) (pp. 209-219). Berlin Heidelberg: Springer-Verlag.
59. Wilson, S. W. (2001). Mining oblique data with XCS. In Lanzi, P. L., Stolzmann, W., & Wilson, S. W. (Eds.), Advances in learning classifier systems: Third international workshop, IWLCS 2000 (LNAI 1996) (pp. 158-174). Berlin Heidelberg: SpringerVerlag.