A clustering entropy-driven approach for exploring and exploiting noisy functions

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2007, Pages 738-742

  Liu, Shih Hsi ^a   Mernik, Marjan ^b   Bryant, Barrett R ^a  

^a UNIVERSITY OF ALABAMA AT BIRMINGHAM   (United States)

^b UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Cluster; Entropy; Exploitation; Exploration

Indexed keywords

EVOLUTIONARY ALGORITHMS; FUNCTION EVALUATION; MEASUREMENT THEORY; PROBLEM SOLVING;

CLUSTERING ENTROPY-DRIVEN APPROACH; MULTIMODAL FUNCTIONS;

GAUSSIAN DISTRIBUTION;

EID: 35248844896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1244002.1244166     Document Type: Conference Paper

References (20)

1. H. B. Amor and A. Rettinger. Intelligent exploration for genetic algorithms: Using self-organizing maps in evolutionary computation. In Proc. Genetic and Evolutionary Computation Conference, pages 1531-1538, 2005.
2. T. Back, D. B. Fogel, and Z. Michalewicz. Handbook of Evolutionary Computation. University of Oxford Press, 1996.
3. J. M. Fitzpatrick and J. J. Greffenstette. Genetic algorithms in noisy environments. Machine Learning, 3:101-120, 1988.
4. rd Intl. Conf. on Genetic Algorithms, pages 104-109, 1989.
5. D. Goldberg. The race, the hurdle, and the sweet spot. In P. J. Bentley, editor, Evolutionary Design by Computers, pages 105-118. Morgan Kaufmann, 1999.
6. D. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362, 1992.
7. J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, 2001.
8. N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Intl. Conf. on Evolutionary Computation, pages 312-317, 1996.
9. th ACM Symposium on Applied Computing, pages 351-355, 2001.
10. rd Intl. Conf. on Genetic Algorithms, pages 51-60, 1989.
11. Y. Jin. A comprehensive survey of fitness approximation in evolutionary computation. Soft Computing, 9(1):3-12, 2005.
12. S.-H. Liu. PPCEA: A domain-specific language for evolutionary algorithms. http://www.cis.uab.edu/liush/PPCea.
13. st Intl. Conf. on Bioinspired Optimization Methods and their Applications, pages 41-50, 2004.
14. nd Intl. Conf. on Bioinspired Optimization Methods and their Applications, pages 15-24, 2006.
15. S.-H. Liu, M. Mernik, and B. R. Bryant. To explore or to exploit: An entropy-driven approach for evolutionary algorithms. Technical Report UABCIS-TR-2006-1019-1, Dept. of Computer and Information Sciences, Univ. of Alabama at Birmingham, 2006.
16. Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, 1996.
17. J. Rosca. Entropy-driven adaptive representation. In Workshop on Genetic Programming: From Theory to Real-World Applications, pages 23-32, 1995.
18. T. Kohonen et al. Self-Organizing Maps. Springer-Verlag, 2001.
19. R. Ursem. Diversity-guided evolutionary algorithms. In Parallel Problem Solving from Nature VII, pages 462-471. Springer-Verlag.
20. X. Yao, Y. Liu, and G. Lin. Evolutionary programming made faster. IEEE Trans. on Evolutionary Computation, 3(2):82-102, 1999.