Linkage identification by perturbation and decision tree induction

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 357-363

  Chuang, Chung Yao ^a,b   Chen, Ying Ping ^a,b  

^a IEEE

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; EVOLUTIONARY ALGORITHMS; NUMERICAL METHODS; PERTURBATION TECHNIQUES; PROBLEM SOLVING;

INDUCTIVE LINKAGE IDENTIFICATION (ILI); LINKAGE INFORMATION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 79955307287     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424493     Document Type: Conference Paper

References (23)

1. D. E. Goldberg, B. Korb, and K. Deb, "Messy genetic algorithms: Motivation, analysis, and first results," Complex Systems, vol. 3, no. 5, pp. 493-530, 1989.
2. H. Kargupta, "SEARCH, polynomial complexity, and the fast messy genetic algorithm," Ph.D. dissertation, University of Illinois, 1995.
3. G. Harik, "Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms," Ph.D. dissertation, University of Illinois, 1997.
4. Y.-p. Chen, Extending the scalability of linkage learning genetic algorithms: Theory and practice, ser. Studies in Fuzziness and Soft Computing. Springer, 2006, vol. 190, ISBN: 3-540-28459-1.
5. H. Muhlenbein and G. PaaB, "From recombination of genes to the estimation of distributions i. binary parameters," in PPSN IV: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature. London, UK: Springer-Verlag, 1996, pp. 178-187.
6. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning," Pittsburgh, PA, USA, Tech. Rep., 1994.
7. G. R. Harik, F. G. Lobo, and D. E. Goldberg, "The compact genetic algorithm," IEEE Transactions on Evolutionary Computation,vol.3, no. 4, p. 287, November 1999.
8. J. de Bonet, C. Isbell, and P. Viola, "MIMIC: Finding optima by estimating probability densities," in Advances in Neural Information Processing Systems, M. C. Mozer, M. I. Jordan, and T. Petsche, Eds., vol. 9. The MIT Press, 1997, p. 424.
9. S. Baluja and S. Davies, "Using optimal dependency-trees for combinational optimization," in ICML '97: Proceedings of the Fourteenth International Conference on Machine Learning. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1997, pp. 30-38.
10. M. Pelikan and H. Muhlenbein, 'The bivariate marginal distribution algorithm," in Advances in Soft Computing - Engineering Design and Manufacturing, R. Roy, T. Furuhashi, and P. K. Chawdhry, Eds. London: Springer-Verlag, 1999, pp. 521-535.
11. G. Harik, "Linkage learning via probabilistic modeling in the ECGA," Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign., IlliGAL Report No. 99010, 1999.
12. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, "BOA: The Bayesian optimization algorithm," in Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds., vol. I. Orlando, FL: Morgan Kaufmann Publishers, San Fransisco, CA, 13-17 1999, pp. 525-532.
13. H. Muhlenbein and T. Mahnig, "FDA - A scalable evolutionary algorithm for the optimization of additively decomposed functions," Evolutionary Computation, vol. 7, no. 4, pp. 353-376, 1999.
14. H. Muhlenbein and R. Hons, "The estimation of distributions and the minimum relative entropy principle," Evolutionary Computation,vol.13, no. 1, pp. 1-27, 2005.
15. M. Tsuji, M. Munetomo, and K. Akama, "Linkage identification by fitness difference clustering," Evolutionary Computation, vol. 14, no. 4, pp. 383-409, 2006.
16. H. Kargupta, "The gene expression messy genetic algorithm," in International Conference on Evolutionary Computation, 1996, pp. 814-819.
17. M. Munetomo and D. Goldberg, "Identifying linkage by nonlinearity check," Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign., IlliGAL Report No. 98012, 1998.
18. M. Munetomo and D. E. Goldberg, "Identifying linkage groups by nonlinearity/non-monotonicity detection," in Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, Eds., vol. 1. Orlando, Florida, USA: Morgan Kaufmann, 13-17 1999, pp. 433-440.
19. R. B. Heckendorn and A. H. Wright, "Efficient linkage discovery by limited probing," Evolutionary Computation, vol. 12, no. 4, pp. 517-545, 2004.
20. J. R. Quinlan, "Induction of decision trees," in Readings in knowledge acquisition and learning: automating the construction and improvement of expert systems. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1993, pp. 349-361.
21. E. D. de Jong, R. Watson, and D. Thierens, "On the complexity of hierarchical problem solving," in GECCO-05: Proceedings of the 2005 conference on Genetic and evolutionary computation. New York, NY, USA: ACM Press, 2005, pp. 1201-1208.
22. J. H. Holland, Adaptation in natural and artificial systems. Cambridge, MA, USA: MIT Press, 1992.
23. D. E. Goldberg, The Design of Innovation: Lessons from and for Competent Genetic Algorithms. Norwell, MA, USA: Kluwer Academic Publishers, 2002.