Population-based continuous optimization, probabilistic modelling and mean shift

Evolutionary Computation

Volumn 13, Issue 1, 2005, Pages 29-42

  Gallagher, Marcus ^a   Frean, Marcus ^b  

^a UNIVERSITY OF QUEENSLAND   (Australia)

^b VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Continuous optimization; Estimation of distribution algorithms; Mean shift; Population based incremental learning; Probabilistic modelling

Indexed keywords

CONTINUOUS OPTIMIZATION; ESTIMATION OF DISTRIBUTION ALGORITHMS; MEAN SHIFT; POPULTIONA-BASED INCREMENTAL LEARNING; PROBABILISTIC MODELING;

EVOLUTIONARY ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; POPULATION STATISTICS; PROBABILITY; PROBABILITY DENSITY FUNCTION; PROBLEM SOLVING; RANDOM PROCESSES;

OPTIMIZATION;

ALGORITHM; ARTICLE; BIOLOGY; CLUSTER ANALYSIS; EVOLUTION; METHODOLOGY; MOLECULAR EVOLUTION; NORMAL DISTRIBUTION; POPULATION DYNAMICS; PROBABILITY; STATISTICAL MODEL; THEORETICAL MODEL;

ALGORITHMS; CLUSTER ANALYSIS; COMPUTATIONAL BIOLOGY; EVOLUTION; EVOLUTION, MOLECULAR; MODELS, STATISTICAL; MODELS, THEORETICAL; NORMAL DISTRIBUTION; POPULATION DYNAMICS; PROBABILITY;

EID: 15544373170     PISSN: 10636560     EISSN: None     Source Type: Journal    
DOI: 10.1162/1063656053583478     Document Type: Article

References (27)

1. Baluja, S. (1994). Population-Based Incremental Learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, School of Computer Science, Carnegie Mellon University.
2. Baluja, S. (1997). Genetic algorithms and explicit search statistics. In Mozer, M., Jordan, M., and Petsche, T., editors, Advances in Neural Information Processing Systems, volume 9, pages 319-325, Cambridge, MA. The MIT Press.
3. Baluja, S. and Davies, S. (1997). Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. Technical Report CMU-CS-97-107, Carnegie Mellon University.
4. Berny, A. (2000a). An adaptive scheme for real function optimization acting as a selection operator. In Yao, X. and Fogel, D., editors, First IEEE Symposium on Combinations of Evolutionary Computation and Neural Networks, pages 140-149. IEEE.
5. Berny, A. (2000b). Selection and reinforcement learning for combinatorial optimization. In et al., M. S., editor, Parallel Problem Solving from Nature - PPSN VI, volume 1917 of Lecture Notes in Computer Science, pages 601-610. Springer Verlag.
6. Berny, A. (2001). Statistical machine learning and combinatorial optimization. In Kallel, L., Naudts, B., and Rogers, A., editors, Theoretical Aspects of Evolutionary Computation, pages 287-306. Springer Verlag.
7. Bosman, P. A. N. and Thierens, D. (1999). An algorithmic framework for density estimation based evolutionary algorithms. Technical Report UU-CS-1999-46, Department of Computer Science, Utrecht University.
8. Bosman, P. A. N. and Thierens, D. (2000). Expanding from discrete to continuous estimation of distribution algorithms: The IDEA. In Parallel Problem Solving from Nature - PPSN VI, volume 1917 of Lecture Notes in Computer Science, pages 767-776.
9. Boyan, J., Buntine, W., and (eds.), A. J. (2000). Statistical machine learning for large-scale optimization. Neural Computing Surveys, 3:1-58.
10. Cheng, Y. (1995). Mean shift, mode seeking and clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8):790-799.
11. De Bonet, J. S., Isbell, Jr., C. L., and Viola, P. (1997). MIMIC: Finding optima by estimating probability densities. In Advances in Neural Information Processing Systems, volume 9, pages 424-430.
12. Etxebrria, R. and Larrañaga, P. (1999). Global optimization with Bayesian networks. In 2nd Symposium on Artificial Intelligence/CIMAF99, pages 332-339.
13. Fogel, D. B. (1995). Evolutionary computation: toward a new philosophy of machine intelligence. IEEE Press, New York.
14. Fukunaga, K. and Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory, IT-21(1):32-40.
15. Gallagher, M. (2000). Multi-layer perceptron error surfaces: visualization, structure and modelling. PhD thesis, Dept. Computer Science and Electrical Engineering, University of Queensland.
16. Gallagher, M., Frean, M., and Downs, T. (1999). Real-valued evolutionary optimization using a flexible probability density estimator. In Banzhaf, W. and et al., editors, Proc. Genetic and Evolutionary Computation Conference (GECCO'99), pages 840-846, San Francisco, CA. Morgan Kaufmann.
17. González, C., Lozano, J. A., and Larrañaga, P. (2000). Analyzing the PBIL algorithm by means of discrete dynamical systems. Complex Systems, 12(4):465-479.
18. González, C., Lozano, J. A., and Larrañaga, P. (2002). Mathematical modelling of discrete estimation of distribution algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, chapter 6, pages 147-163. Kluwer.
19. Hertz, J., Krogh, A., and Palmer, R. G. (1991). Introduction to the Theory of Neural Computation. Addison-Wesley, Redwood City, CA.
20. Larrañaga, P. (2002). A review on estimation of distribution algorithms. In Larrañaga, P. and Lozano, J. A., editors, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, chapter 3, pages 57-100. Kluwer.
21. Larrañaga, P. and Lozano, J. A., editors (2002). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer.
22. Pelikan, M., Goldberg, D. E., and Cantú-Paz, E. (1999). BOA: The Bayesian optimization algorithm. In Banzhaf, W. and et al, editors, Proc. Genetic and Evolutionary Computation Conference (GECCO'99), pages 525-532, San Francisco, CA. Morgan Kaufmann.
23. Pelikan, M., Goldberg, D. E., and Lobo, F. (2002). A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20.
24. Rudlof, S. and Köppen, M. (1996). Stochastic hill climbing with learning by vectors of normal distributions. In 1st Online Workshop on Soft Computing, Retrieved from http://www.bioele.nuee.nagoya-u.ac.jp/wscl/ (8/12/99).
25. Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Wiley, New York.
26. Sebag, M. and Ducoulombier, A. (1998). Extending population-based incremental learning to continuous search spaces. In Eiben, A. and et al., editors, Parallel Problem Solving from Nature - PPSN V, volume 1498 of Lecture Notes in Computer Science, pages 418-427, Springer Verlag.
27. Törn, A. and Žilinskas, A. (1989). Global Optimization, volume 350 of Lecture Notes in Computer Science. Springer Verlag.