{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:27Z","timestamp":1725486507364},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290063"},{"type":"electronic","value":"9783540324942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-32494-1_2","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T18:56:07Z","timestamp":1182192967000},"page":"39-50","source":"Crossref","is-referenced-by-count":6,"title":["Entropy-based Convergence Measurement in Discrete Estimation of Distribution Algorithms"],"prefix":"10.1007","author":[{"given":"Jiri","family":"Ocenasek","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Learning Bayesian networks is NP-hard","author":"D. M. Chickering","year":"1994","unstructured":"D. M. Chickering, D. Geiger, and D. Heckerman. Learning Bayesian networks is NP-hard. Technical report, Microsoft Research, Redmond, WA, 1994."},{"key":"2_CR2","unstructured":"D. M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. In Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 80\u201389. Morgan Kaufmann, 1997."},{"key":"2_CR3","unstructured":"R. Etxeberria and P. Larra\u00f1aga. Global optimization with Bayesian networks. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pp. 332\u2013339, 1999."},{"key":"2_CR4","unstructured":"G. Harik. Finding multimodal solutions using restricted tournament selection. In Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA 6), pp. 24\u201331. Morgan Kaufmann, 1995."},{"key":"2_CR5","volume-title":"Learning Bayesian networks: The combination of knowledge and statistical data","author":"D. Heckerman","year":"1994","unstructured":"D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Technical report, Microsoft Research, Redmond, WA, 1994."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"P. Larra\u00f1aga. A review on estimation of distribution algorithms. In P. Larra\u00f1aga and J. A. Lozano, editors, Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation, pp. 80\u201390. Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-1-4615-1539-5_3"},{"issue":"4","key":"2_CR7","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H. M\u00fchlenbein","year":"1999","unstructured":"H. M\u00fchlenbein and T. Mahnig. FDA \u2014 a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7(4):353\u2013376, 1999.","journal-title":"Evolutionary Computation"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein and G. Paa\u00df. From recombination of genes to the estimation of distributions I. Binary parameters. In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature-PPSN IV, pp. 178\u2013187, 1996.","DOI":"10.1007\/3-540-61723-X_982"},{"key":"2_CR9","unstructured":"J. Ocenasek and J. Schwarz. Estimation of distribution algorithm for mixed continuous-discrete optimization problems. In IOS Press, editor, 2nd Euro-International Symposium on Computational Intelligence, pp. 227\u2013232, 2002."},{"key":"2_CR10","first-page":"525","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99","author":"M. Pelikan","year":"1999","unstructured":"M. Pelikan, D. E. Goldberg, and E. Cant\u00fa-Paz. BOA: The Bayesian optimization algorithm. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume 1, pp. 525\u2013532. Morgan Kaufmann Publishers, San Francisco, CA, 1999. Orlando, FL."},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5\u201320, 2002.","journal-title":"Computational Optimization and Applications"},{"key":"2_CR12","unstructured":"M. Pelikan, D. E. Goldberg, and K. Sastry. Bayesian optimization algorithm, decision graphs, and Occam\u2019s razor. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2001, pp. 519\u2013526. Morgan Kaufman, 2000."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"M. Pelikan, J. Ocenasek, S. Trebst, M. Troyer, and F. Alet. Computational complexity and simulation of rare events of ising spin glasses. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2004, pp. 36\u201347. Springer-Verlag, 2004.","DOI":"10.1007\/978-3-540-24855-2_4"}],"container-title":["Studies in Fuzziness and Soft Computing","Towards a New Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-32494-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:53:33Z","timestamp":1605628413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32494-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540290063","9783540324942"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-32494-1_2","relation":{},"ISSN":["1434-9922"],"issn-type":[{"type":"print","value":"1434-9922"}],"subject":[]}}