Reducing Bloat in GP with Multiple Objectives

Natural Computing Series

Volumn , Issue , 2008, Pages 177-200

  Bleuler, Stefan ^a   Bader, Johannes ^a   Zitzler, Eckart ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85128837456     PISSN: 16197127     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-72964-8_9     Document Type: Chapter

References (32)

1. H. A. Abbass and K. Deb. Searching under Multi-evolutionary Pressures. In C. M. Fonseca et al., editors, Evolutionary Multi-Criterion Optimization. Second International Conference, EMO 2003, pages 391–404, Berlin, Germany, 2003. Springer. Lecture Notes in Computer Science. Volume 2632.
2. W. Banzhaf, F. D. Francone, R. E. Keller, and P. Nordin. Genetic Programming: An Introduction. Morgan Kaufmann, San Francisco, CA, 1998.
3. Y. Bemstein, X. Li, V. Ciesielski, and A. Song. Multiobjective parsimony enforcement for superior generalisation performance. In IEEE, editor, CEC 04, pages 83–89, 2004.
4. S. Bleuler, M. Brack, L. Thiele, and E. Zitzler. Multiobjective Genetic Programming: Reducing Bloat by Using SPEA2. In Congress on Evolutionary Computation (CEC-2001), pages 536–543, Piscataway, NJ, 2001. IEEE.
5. T. Blickle. Evolving Compact Solutions in Genetic Programming: A Case Study. In H. M. Voigt et al., editors, PPSN IV, pages 564–573. Springer-Verlag, 1996.
6. T. Blickle and L. Thiele. Genetic programming and redundancy. In J. Hopf, editor, Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), pages 33–38, 1994.
7. E. D. De Jong, R. A. Watson, and J. B. Pollack. Reducing Bloat and Promoting Diversity using Multi-Objective Methods. In L. Spector et al., editors, Genetic and Evolutionary Computation Conference (GECCO 2001), pages 11–18. Morgan Kaufmann Publishers, 2001.
8. K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist nondominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In M. Schoenauer et al., editors, Parallel Problem Solving from Nature (PPSN VI), Lecture Notes in Computer Science Vol. 1917, pages 849–858. Springer, 2000.
9. A. Ekárt and S. Z. Németh. Selection Based on the Pareto Nondomination Criterion for Controlling Code Growth in Genetic Programming. Genetic Programming and Evolvable Machines, 2:61–73, 2001.
10. A. Hunter. Expression Inference-Genetic Symbolic Classification Integrated with Non-linear Coefficient Optimisation. In AISC 02, LNCS. Springer, 2002.
11. E. D. D. Jong and J. B. Pollack. Multi-objective methods for tree size control. Genetic Programming and Evolvable Machines, 4:211–233, 2003.
12. T. Kalganova and J. F. Miller. Evolving More Efficient Digital Circuits by Allowing Circuit Layout Evolution and Multi-Objective Fitness. In A. Sto-ica et al., editors, Proceedings of the 1st NASA/DoD Workshop on Evolvable Hardware (EH’99), pages 54–63, Piscataway, NJ, 1999, 1999. IEEE Computer Society Press.
13. J. D. Knowles, R. A. Watson, and D. W. Corne. Reducing Local Optima in Single-Objective Problems by Multi-objectivization. In E. Zitzler et al., editors, Evolutionary Multi-Criterion Optimization (EMO 2001), volume 1993 of Lecture Notes in Computer Science, pages 269–283, Berlin, 2001. Springer-Verlag.
14. A. Kordon, E. Jordaan, L. Chew, G. Smits, T. Bruck, K. Haney, and A. Jenings. Biomass Inferential Sensor Based on Ensemble of Models Generated by Genetic Programming. In GECCO 04, LNCS, pages 1078–1089. Springer, 2004.
15. M. Kotanchek, G. Smits, and E. Vladislavleva. Pursuing the Pareto Paradigm Tournaments, Algorithm Variations & Ordinal Optimization. In R. L. Riolo, T. Soule, and B. Worzel, editors, Genetic Programming Theory and Practice IV, volume 5 of Genetic and Evolutionary Computation, chapter 3. Springer, 2006.
16. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992.
17. J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge, Massachusetts, 1994.
18. W. B. Langdon. Quadratic Bloat in Genetic Programming. In D. Whitley et al., editors, GECCO 2000, pages 451–458, Las Vegas, Nevada, USA, 10-12 2000. Morgan Kaufmann. ISBN 1-55860-708-0.
19. W. B. Langdon and R. Poli. Fitness Causes Bloat. In P. K. Chawdhry et al., editors, Soft Computing in Engineering Design and Manufacturing, pages 13– 22, Godalming, GU7 3DJ, UK, 1997. Springer-Verlag.
20. X. Llorà, D. E. Goldberg, I. Traus, and E. Bernadó. Accuracy, parsimony, and generality in evolutionary learning systems via multiobjective selection. In Learning Classifier Systems, pages 118–142. Springer. Lecture Notes in Artificial Intelligence Vol. 2661, 2002.
21. L. Panait and S. Luke. Alternative Bloat Control Methods. In GECCO 04, LNCS, pages 630–641. Springer, 2004.
22. D. Parrot, L. Xiandong, and V. Ciesielski. Multi-objective techniques in genetic programming for evolving classifiers. In CEC 05, pages 1141–1148. IEEE, 2005.
23. K. Rodríguez-Vázquez, C. M. Fonseca, and P. J. Fleming. Multiobjective genetic programming: A nonlinear system identification application. In J. R. Koza, editor, Late Breaking Papers at the 1997 Genetic Programming Conference, pages 207–212, Stanford University, CA, USA, 13–16 1997. Stanford Bookstore. ISBN 0-18-206995-8.
24. G. F. Smits and M. Kotanchek. Pareto-Front Exploitation in Symbolic Regression. In Genetic Programming Theory and Practice II, volume 8. Springer, 2005.
25. T. Soule and J. A. Foster. Removal Bias: a New Cause of Code Growth in Tree Based Evolutionary Programming. In 1998 IEEE International Conference on Evolutionary Computation, pages 781–186, Anchorage, Alaska, USA, 1998. IEEE Press. URL http://citeseer.ist.psu.edu/313655.html.
26. T. Soule and J. A. Foster. Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming. Evoluationary Computation, 6(4): 293–309, 1999.
27. M. Streeter and L. A. Becker. Automated Discovery of Numerical Approximation Formulae via Genetic Programming. Genetic Programming and Evolvable Machines, 4(3):255–286, 2003.
28. B.-T. Zhang and H. Mühlenbein. Balancing Accuracy and Parsimony in Genetic Programming. Evoluationary Computation, 3(1):17–38, 1995.
29. Y. Zhang and P. I. Rockett. Evolving optimal feature extraction using multiobjective genetic programming: a methodology and preliminary study on edge detection. In GECCO 05, pages 795–802, New York, NY, USA, 2005. ACM Press.
30. E. Zitzler. Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH) Zürich, Switzerland, 1999.
31. E. Zitzler, M. Laumanns, and L. Thiele. SPEA2: Improving the Strength Pareto Evolutionary Algorithm for Multiobjective Optimization. In K. Giannakoglou et al., editors, Evolutionary Methods for Design, Optimisation and Control with Application to Industrial Problems (EUROGEN 2001), pages 95–100. International Center for Numerical Methods in Engineering (CIMNE), 2002.
32. E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257–271, 1999.