{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:48:24Z","timestamp":1725486504168},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_5","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T18:56:07Z","timestamp":1182192967000},"page":"103-122","source":"Crossref","is-referenced-by-count":3,"title":["Estimation of Distribution Programming: EDA-based Approach to Program Generation"],"prefix":"10.1007","author":[{"given":"Kohsuke","family":"Yanai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hitoshi","family":"Iba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"P. J. Angeline. Two selfadaptive crossover operations for genetic programming. In Advances in Genetic Programming II. MIT Press, 1995.","DOI":"10.7551\/mitpress\/1109.001.0001"},{"key":"5_CR2","unstructured":"P. J. Angeline. Subtree crossover causes bloat. In Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 745\u2013752. Morgan Kaufmann, 22\u201325 July 1998."},{"key":"5_CR3","series-title":"Technical Report","volume-title":"Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning","author":"S. Baluja","year":"1994","unstructured":"S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994."},{"key":"5_CR4","unstructured":"B. Cestnik. Estimating probabilities: A crucial task in machine learning. In Proceedings of the 9th European Conference on Artificial Intelligence, pp. 147\u2013149, 1990."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"J. M. Daida, H. Li, R. Tang, and A. M. Hilss. What makes a problem GP-hard? validating a hypothesis of structural causes. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-2004, pp. 1665\u20131677. Springer-Verlag, 2003.","DOI":"10.1007\/3-540-45110-2_60"},{"key":"5_CR6","unstructured":"H. Iba and H. de Garis. Extending genetic programming with recombinative guidance. In Advances in Genetic Programming 2, pp. 69\u201388. MIT Press, 1995."},{"key":"5_CR7","first-page":"1061","volume":"2","author":"C. Igel","year":"1999","unstructured":"C. Igel and K. Chellapilla. Investigating the influence of depth and degree of genotypic change on fitness in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-1999, volume 2, pp. 1061\u20131068. Morgan Kaufmann, 13\u201317 July 1999.","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-1999"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"T. Ito, H. Iba, and S. Sato. Depth-dependent crossover for genetic programming. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pp. 775\u2013780. IEEE Press, 5\u20139 May 1998.","DOI":"10.1109\/ICEC.1998.700150"},{"key":"5_CR9","unstructured":"J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, 1992."},{"key":"5_CR10","first-page":"1092","volume":"2","author":"W. B. Langdon","year":"1999","unstructured":"W. B. Langdon. Size fair and homologous tree genetic programming crossovers. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-1999, volume 2, pp. 1092\u20131097. Morgan Kaufmann, 13\u201317 1999.","journal-title":"Proceedings of the Genetic and Evolutionary Computation Conference GECCO-1999"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"W. B. Langdon and R. Poli. Genetic programming bloat with dynamic fitness. In Proceedings of the First European Workshop on Genetic Programming. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055931"},{"key":"5_CR12","unstructured":"P. Larr\u00f1naga, R. Etxeberria, J. A. Lozano, and J. M. Pe\u00f1a. Combinatorial optimization by learning and simulation of Bayesian networks. In Proceedings of the Conference in Uncertainty in Artificial Intelligence: UAI-2000, pp. 343\u2013352, 2000."},{"key":"5_CR13","unstructured":"P. Larra\u00f1aga, R. Etxeberria, J. A. Lozano, and J.M. Pe\u00f1a. Optimization in continuous domains by learning and simulation of Gaussian networks. In Proceedings of the Workshop in Optimization by Building and Using Probabilistic Models, pp. 201\u2013204, 2000."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"T. K. Paul and H. Iba. Reinforcement learning estimation of distribution algorithm. In Proceedings of Genetic and Evolutionary Computation Conference GECCO-2003. Springer-Verlag, 2003.","DOI":"10.1007\/3-540-45110-2_2"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"T. K. Paul and H. Iba. Selection of the most useful subset of genes for gene expression-based classification. In Proceedings of Congress on Evolutionary Computation: CEC-2004, 2004.","DOI":"10.1109\/CEC.2004.1331152"},{"key":"5_CR16","unstructured":"R. Poli and W. B. Langdon. On the search properties of different crossover operators in genetic programming. In Genetic Programming 1998: Proceedings of the Third Annual Conference, pp. 293\u2013301. Morgan Kaufmann, 22\u201325 1998."},{"key":"5_CR17","unstructured":"R. Poli and W. B. Langdon. Foundations of Genetic Programming. Springer-Verlag, 2002."},{"key":"5_CR18","unstructured":"W. F. Punch, D. Zongker, and E. D. Goodman. The royal tree problem, a benchmark for single and multiple population genetic programming. In Advances in Genetic Programming II, pp.299\u2013316. MIT Press, 1995."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"R. P. Salustowicz and J. Schmidhuber. Probabilistic incremental program evolution: Stochastic search through program space. In M. van Someren and G. Widmer, editors, Machine Learning: ECML-97, volume 1224, pp. 213\u2013220. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62858-4_86"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"T. Yabuki and H. Iba. Genetic programming using a Turing complete representation: recurrent network consisting of trees. In L. Nunes de Castro and F. J. Von Zuben, editors, Recent Developments in Biologically Inspired Computing. Idea Group Inc., 2004. (to be published).","DOI":"10.4018\/978-1-59140-312-8.ch004"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"K. Yanai and H. Iba. Estimation of distribution programming based on Bayesian networks. In Proceedings of Congress on Evolutionary Computation: CEC-2003, pp. 1618\u20131625, 2003.","DOI":"10.1109\/CEC.2003.1299866"}],"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_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:57:31Z","timestamp":1683878251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-32494-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540290063","9783540324942"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-32494-1_5","relation":{},"ISSN":["1434-9922"],"issn-type":[{"type":"print","value":"1434-9922"}],"subject":[]}}