{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:27:29Z","timestamp":1761863249039,"version":"3.40.4"},"reference-count":133,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T00:00:00Z","timestamp":1379376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10710-013-9205-x","type":"journal-article","created":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T09:29:22Z","timestamp":1379323762000},"page":"115-167","source":"Crossref","is-referenced-by-count":32,"title":["Probabilistic model building in genetic programming: a critical review"],"prefix":"10.1007","volume":"15","author":[{"given":"Kangil","family":"Kim","sequence":"first","affiliation":[]},{"given":"Yin","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Xuan Hoai","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"R. I.","family":"McKay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,17]]},"reference":[{"key":"9205_CR1","unstructured":"H.A. Abbass, X. Hoai, R.I. McKay. AntTAG: A new method to compose computer programs using colonies of ants. In Proceedings of the 2002 IEEE Congress on Evolutionary Computation, vol. 2, Honolulu, HI, USA. (IEEE Press, New York, 2002), p. 1654\u20131659"},{"key":"9205_CR2","unstructured":"P.J. Angeline. Subtree crossover: Building block engine or macromutation? In Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 9\u201317, Stanford University, CA, USA, 13\u201316 July 1997. Morgan Kaufmann"},{"key":"9205_CR3","unstructured":"P.J. Angeline, J.B. Pollack. Coevolving high-level representations. In Artificial Life III, vol. XVII of Santa Fe Institute Series, pages 55\u201371, Santa Fe, New Mexico, USA, 15\u201319 June 1994. Addison-Wesley, USA"},{"key":"9205_CR4","unstructured":"S. Baluja. Population-based incremental learning: a method for integrating genetic searching based function optimization. Technical Report CMU-CS-94-163, Computer Science Dept, Carnegie Mellon University, Pittsburgh, PA, USA, 1994"},{"key":"9205_CR5","unstructured":"W. Banzhaf. Genetic programming for pedestrians. In Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, p. 628, Urbana-Champaign, IL, USA, 17\u201321 July 1993. Morgan Kaufmann"},{"key":"9205_CR6","doi-asserted-by":"crossref","unstructured":"W. Banzhaf, P. Nordin, R.E. Keller, F.D. Francone. Genetic Programming: An Introduction; On the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann, San Francisco, 1998","DOI":"10.1007\/BFb0055923"},{"key":"9205_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0303-2647(96)01657-7","volume":"41","author":"H.G. Beyer","year":"1997","unstructured":"H.G. Beyer, An alternative explanation for the manner in which genetic algorithms operate. BioSystems 41, 1\u201315 (1997)","journal-title":"BioSystems"},{"key":"9205_CR8","doi-asserted-by":"crossref","unstructured":"M. Birattari, G. Di Caro, and M. Dorigo. Toward the formal foundation of ant programming. In Proceedings of the Third International Workshop on Ant Algorithms, volume 2463 of Lecture Notes in Computer Science, pages 188\u2013201, Brussels, Belgium September 2002. (Springer, Berlin), p. 12\u201314","DOI":"10.1007\/3-540-45724-0_16"},{"key":"9205_CR9","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"C.M. Bishop","year":"2006","unstructured":"C.M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics). (Springer, New York, Inc., Secaucus, 2006)"},{"issue":"1-2","key":"9205_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FUN-2005-681-201","volume":"68","author":"M Boryczka","year":"2005","unstructured":"M. Boryczka, Eliminating introns in ant colony programming. Fundamenta Informaticae 68(1-2), 1\u201319 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"9205_CR11","doi-asserted-by":"crossref","unstructured":"M. Boryczka. Ant colony programming with the candidate list. In Proceedings of the Agent and Multi-Agent Systems: Technologies and Applications, Second KES International Symposium, KES-AMSTA 2008, volume 4953 of Lecture Notes in Computer Science, pp. 302\u2013311, Incheon, Korea, 26\u201328 March 2008. (Springer, Berlin)","DOI":"10.1007\/978-3-540-78582-8_31"},{"key":"9205_CR12","unstructured":"M. Boryczka, Z.J. Czech. Solving approximation problems by ant colony programming. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, 9-13 July 2002. (Morgan Kaufmann Publishers), p. 133"},{"key":"9205_CR13","unstructured":"P.A.N. Bosman, E.D. de Jong. Grammar transformations in an EDA for genetic programming. In Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference\u2014GECCO-2004, Seattle, Washington, USA, June 2004. (Springer, Berlin)"},{"key":"9205_CR14","doi-asserted-by":"crossref","unstructured":"P.A.N. Bosman, E.D. de Jong. Learning probabilistic tree grammars for genetic programming. In Parallel Problem Solving from Nature - PPSN VIII, volume 3242 of Lecture Notes in Computer Science Birmingham, UK, Sep 2004. (Springer, Berlin), p. 192\u2013201","DOI":"10.1007\/978-3-540-30217-9_20"},{"key":"9205_CR15","unstructured":"P.A.N. Bosman, D. Thierens. Continuous iterated density estimation evolutionary algorithms within the IDEA framework. In Proceedings of the Optimization by Building and Using Probabilistic Models OBUPM Workshop at the Genetic and Evolutionary Computation Conference (GECCO-2000), Las Vegas, Nevada, USA, 8\u201312 July 2000. (Morgan Kaufmann, Burlington), p. 197\u2013200"},{"key":"9205_CR16","doi-asserted-by":"crossref","unstructured":"E.K. Burke, M.R. Hyde, G. Kendall, G. Ochoa, E. Ozcan, and J.R. Woodward. Exploring hyper-heuristic methodologies with genetic programming, volume 1 of Intelligent systems Reference Library, chapter 6 Springer, 2009, pp 177\u2013201","DOI":"10.1007\/978-3-642-01799-5_6"},{"key":"9205_CR17","doi-asserted-by":"crossref","unstructured":"J. Clegg. Combining cartesian genetic programming with an estimation of distribution algorithm. In GECCO \u201908: Proceedings of the 10th annual conference on Genetic and evolutionary computation, Atlanta, GA, USA, 12-16 July 2008. ACM, p. 1333\u20131334","DOI":"10.1145\/1389095.1389350"},{"key":"9205_CR18","unstructured":"N. L. Cramer. A representation for the adaptive generation of simple sequential programs. In Proceedings of an International Conference on Genetic Algorithms and the Applications, Carnegie Mellon University, Pittsburgh, PA, USA, 24-26 July 1985, p. 183\u2013187"},{"issue":"1-2","key":"9205_CR19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0004-3702(00)00077-1","volume":"125","author":"A.S. d\u2019Avila Garcez","year":"2001","unstructured":"A.S. d\u2019Avila Garcez, K. Broda, D.M. Gabbay, Symbolic knowledge extraction from trained neural networks: a sound approach. Artif. Intell. 125(1-2), 155\u2013207 (2001)","journal-title":"Artif. Intell."},{"issue":"1","key":"9205_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A.P Dempster","year":"1977","unstructured":"A.P Dempster, N.M. Laird, D.B. Rubin, Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statis. Soc. Series B (Methodological) 39(1), 1\u201338 (1977)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"9205_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M. Dorigo","year":"2004","unstructured":"M. Dorigo, T. St\u00fctzle, Ant Colony Optimization. (MIT Press, Cambridge, MA, 2004)"},{"key":"9205_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to Statistical Relational Learning","author":"L. Getoor","year":"2007","unstructured":"L. Getoor, B. Taskar, Introduction to Statistical Relational Learning. (The MIT Press, Cambridge, 2007)"},{"key":"9205_CR23","volume-title":"Fuzzy Rule-Based Expert Systems and Genetic Machine Learning, volume 3 of Studies in Fuzziness","author":"A. Geyer-Schulz","year":"1995","unstructured":"A. Geyer-Schulz, Fuzzy Rule-Based Expert Systems and Genetic Machine Learning, volume 3 of Studies in Fuzziness. (Physica-Verlag, Heidelberg, 1995)"},{"key":"9205_CR24","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. (Addison-Wesley, USA, 1989)"},{"key":"9205_CR25","unstructured":"J. Green, J.L. Whalley, C.G. Johnson. Automatic programming with ant colony optimization. In Proceedings of the 2004 UK Workshop on Computational Intelligence, UK, 6\u20138 September 2004. (Loughborough University, Loughborough), pp. 70\u201377"},{"key":"9205_CR26","unstructured":"F. Gruau. Genetic synthesis of modular neural networks. In Proceedings of the 5th International Conference on Genetic Algorithms, ICGA-93, Urbana-Champaign, IL, USA, 17-21 July 1993. (Morgan Kaufmann, Burlington), pp. 318\u2013325"},{"key":"9205_CR27","doi-asserted-by":"crossref","unstructured":"P. Haddawy. Generating bayesian networks from probability logic knowledge bases. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, Seatle, WA, USA, 29-31 July 1994. (Morgan Kaufmann Publishers Inc, Burlington) pp. 262\u2013269","DOI":"10.1016\/B978-1-55860-332-5.50038-9"},{"key":"9205_CR28","doi-asserted-by":"crossref","unstructured":"S. Handley. On the use of a directed acyclic graph to represent a population of computer programs. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, vol. 1, pp. 154\u2013159, 1994","DOI":"10.1109\/ICEC.1994.350024"},{"key":"9205_CR29","unstructured":"N. Hansen and A. Ostermeier. Adapting arbitrary normal mutation distributions in evolution strategies: The covariance matrix adaptation. In Evolutionary Computation, 1996., Proceedings of IEEE International Conference on. IEEE, 1996, pp. 312\u2013317"},{"key":"9205_CR30","doi-asserted-by":"crossref","unstructured":"G. Harik, F. Lobo, and K. Sastry. Linkage Learning via Probabilistic Modeling in the Extended Compact Genetic Algorithm (ECGA), volume 33 of Studies in Computational Intelligence. (Springer, Berlin, 2006), pp. 39\u201361","DOI":"10.1007\/978-3-540-34954-9_3"},{"key":"9205_CR31","unstructured":"Y. Hasegawa and H. Iba. Estimation of Bayesian network for program generation. In Proceedings of the Third Asian-Pacific workshop on Genetic Programming, pp. 35\u201346, Military Technical Academy, Hanoi, VietNam, 2006"},{"key":"9205_CR32","doi-asserted-by":"crossref","unstructured":"Y. Hasegawa and H. Iba. Estimation of distribution algorithm based on probabilistic grammar with latent annotations. In Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore, 25\u201328 September 2007. IEEE Computational Intelligence Society, IEEE Press, pp. 1043\u20131050","DOI":"10.1109\/CEC.2007.4424585"},{"issue":"6","key":"9205_CR33","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/TEVC.2008.915999","volume":"12","author":"Y. Hasegawa","year":"2008","unstructured":"Y. Hasegawa, H. Iba, A Bayesian network approach to program generation. IEEE Trans. Evol. Comput. 12(6), 750\u2013764 (2008)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"9205_CR34","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1109\/TEVC.2009.2015574","volume":"13","author":"Y. Hasegawa","year":"2009","unstructured":"Y. Hasegawa, H. Iba, Latent variable model for estimation of distribution algorithm based on a probabilistic context-free grammar. IEEE Trans. Evol. Comput. 13(4), 858\u2013878 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9205_CR35","doi-asserted-by":"crossref","unstructured":"E. Hemberg, K. Veeramachaneni, J. McDermott, C. Berzan, and U.M. O\u2019Reilly. An investigation of local patterns for estimation of distribution genetic programming. In GECCO \u201912: Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference. ACM, 7-11July 2012, pages 767\u2013774","DOI":"10.1145\/2330163.2330270"},{"key":"9205_CR36","doi-asserted-by":"crossref","DOI":"10.1201\/9781439803707","volume-title":"Applied Genetic Programming and Machine Learning","author":"H. Iba","year":"2009","unstructured":"H. Iba, Y. Hasegawa, T.K. Paul, Genetic Programming and Machine Learning. (CRC Complex and Enterprise Systems Engineering. CRC Press, Boca Raton, 2009)"},{"key":"9205_CR37","doi-asserted-by":"crossref","unstructured":"C.Z. Janikow. Adapting representation in genetic programming. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2004), volume 3103 of Lecture Notes in Computer Science. (Springer, Berlin , 2004), pp. 507\u2013518","DOI":"10.1007\/978-3-540-24855-2_61"},{"issue":"1","key":"9205_CR38","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"A.K. Joshi, L.S. Levy, M. Takahashi, Tree adjunct grammars. J. Comput. Syst. Sci. 10(1), 136\u2013163 (1975)","journal-title":"J. Comput. Syst. Sci."},{"key":"9205_CR39","doi-asserted-by":"crossref","unstructured":"W. Kantschik and W. Banzhaf. Linear-tree GP and its comparison with other GP structures. In Genetic Programming, Proceedings of EuroGP\u2019 2001, volume 2038 of Lecture Notes in Computer Science, Lake Como, Italy, 18\u201320 April 2001. Springer, Berlin, pp. 302\u2013312","DOI":"10.1007\/3-540-45355-5_24"},{"key":"9205_CR40","unstructured":"H. Katagiri, K. Hirasama, and J. Hu. Genetic network programming-application to intelligent agents. In 2000 IEEE International Conference on Systems, Man, and Cybernetics, vol 5. IEEE, 8-11 October 2000, pp. 3829\u20133834"},{"key":"9205_CR41","unstructured":"H. Katagiri, K. Hirasawa, J. Hu, and J. Murata. Network structure oriented evolutionary model\u2014genetic network programming\u2013and its comparison with. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, California, USA, 7\u201311 July 2001. (Morgan Kaufmann Publishers Inc., Burlington) p. 179"},{"key":"9205_CR42","unstructured":"C. Keber, M. G. Schuster. Option valuation with generalized ant programming. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, Newyork, USA, 9\u201313 July 2002. (Morgan Kaufmann Publishers, Burlington), p. 74\u201381"},{"key":"9205_CR43","doi-asserted-by":"crossref","unstructured":"K. Kim, B.(R.I.) McKay, D. Punithan. Sampling bias in estimation of distribution algorithms for genetic programming using prototype trees. In PRICAI 2010: 11th Pacific Rim International Conference on AI, volume 6230 of Lecture Notes in Artificial Intelligence. (Springer, Berlin 2010), pp. 100\u2013111","DOI":"10.1007\/978-3-642-15246-7_12"},{"issue":"3","key":"9205_CR44","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TEVC.2012.2196521","volume":"17","author":"K Kim","year":"2013","unstructured":"K. Kim, R.I.(Bob) McKay, Stochastic diversity loss and scalability in estimation of distribution genetic programming. IEEE Trans. Evol. Comput. 17(3), 301\u2013320 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9205_CR45","volume-title":"Probabilistic Graphical Models: Principles and Techniques","author":"D. Koller","year":"2009","unstructured":"D. Koller, N. Friedman, Probabilistic Graphical Models: Principles and Techniques. (The MIT Press, Cambridge, 2009)"},{"key":"9205_CR46","unstructured":"J.R. Koza. Genetic programming: A paradigm for genetically breeding populations of computer programs to solve problems. Technical Report STAN-CS-90-1314, Dept. of Computer Science, Stanford University, June 1990"},{"key":"9205_CR47","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. (MIT press, Cambridge, 1992)"},{"key":"9205_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04726-2","volume-title":"Foundations of Genetic Programming","author":"W.B. Langdon","year":"2002","unstructured":"W.B. Langdon, R. Poli, Foundations of Genetic Programming. (Springer, Berlin, 2002)"},{"key":"9205_CR49","volume-title":"Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (Genetic Algorithms and Evolutionary Computation)","author":"P. Larranaga","year":"2001","unstructured":"P. Larranaga, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (Genetic Algorithms and Evolutionary Computation). (Springer, Berlin, 2001)"},{"key":"9205_CR50","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10732-012-9208-4","volume":"18","author":"P. Larranaga","year":"2012","unstructured":"P. Larranaga, H. Karshenas, C. Bielza, R. Santana, A review on probabilistic graphical models in evolutionary computation. J. Heuristics 18, 795\u2013819 (2012)","journal-title":"J. Heuristics"},{"key":"9205_CR51","unstructured":"P.P. Le, A. Bah, L. H. Ungar. Using prior knowledge to improve genetic network reconstruction from microarray data. In Silico Biology, 4(27), 2004"},{"key":"9205_CR52","unstructured":"X. Li, S. Mabu, H. Zhou, K. Shimada, and K. Hirasawa. Genetic network programming with estimation of distribution algorithms and its application to association rule mining for traffic prediction. In Proceedings of ICROS-SICE International Conference, 2009, Fukuoka, Japan, 18\u201321August 2009. IEEE, pages 3457\u20133462"},{"key":"9205_CR53","doi-asserted-by":"crossref","unstructured":"X. Li, S. Mabu, H. Zhou, K. Shimada, and K. Hirasawa. Genetic network programming with estimation of distribution algorithms for class association rule mining in traffic prediction. In Proceedings of 2010 IEEE Congress on Evolutionary Computation (CEC 2010), Barcelona, Spain, 18\u201323 July 2010. (IEEE Press, New York) pp. 37\u201344","DOI":"10.1109\/CEC.2010.5586456"},{"key":"9205_CR54","doi-asserted-by":"crossref","unstructured":"X. Liu, Y. Wu, and J. Ye. An improved estimation of distribution algorithm in dynamic environments. In 2008 Fourth International Conference on Natural Computation(ICNC\u201908), volume 6, p. 269\u2013272, 2008","DOI":"10.1109\/ICNC.2008.121"},{"key":"9205_CR55","doi-asserted-by":"crossref","unstructured":"M. Looks. Scalable estimation-of-distribution program evolution. In Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 1 of GECCO \u201907, London, UK, 7\u201311 July 2007. (ACM Press, New York) pp. 539\u2013546","DOI":"10.1145\/1276958.1277072"},{"key":"9205_CR56","doi-asserted-by":"crossref","unstructured":"M. Looks, B. Goertzel, and C. Pennachin. Learning computer programs with the Bayesian optimization algorithm. In Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 1 of GECCO \u201905, pp. 747\u2013748, Washington DC, USA, 25\u201329 June 2005. ACM Press, New York","DOI":"10.1145\/1068009.1068134"},{"key":"9205_CR57","volume-title":"Foundations of Statistical Natural Language Processing","author":"C.D. Manning","year":"1999","unstructured":"C.D. Manning, H. Schutze, Foundations of Statistical Natural Language Processing. (MIT Press, Cambridge, 1999)"},{"key":"9205_CR58","doi-asserted-by":"crossref","unstructured":"T. Matsuzaki, Y. Miyao, and J. Tsujii. Probabilistic CFG with latent annotations. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL\u201905), Ann Arbor, Michigan, USA, 25-30 June 2005. Association for Computational Linguistics., pp 75\u201382","DOI":"10.3115\/1219840.1219850"},{"key":"9205_CR59","doi-asserted-by":"crossref","unstructured":"N.F. McPhee, B. Ohs, T. Hutchison. Semantic building blocks in genetic programming. In Proceedings of the 11th European conference on Genetic programming, EuroGP 2008, volume 4971 of Lecture Notes in Computer Science, Naples, Italy, 26-28 March 2008. Springer, Berlin p. 134\u2013145","DOI":"10.1007\/978-3-540-78671-9_12"},{"key":"9205_CR60","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1007677805582","volume":"38","author":"R.S. Michalski","year":"2000","unstructured":"R.S. Michalski, Learnable evolution model: Evolutionary processes guided by machine learning. Mach Learn 38, 9\u201340 (2000)","journal-title":"Mach Learn"},{"key":"9205_CR61","unstructured":"R.S. Michalski and J. Wojtusiak. The distribution approximation approach to learning from aggregated data. Technical Report MLI 08-2, Reports of the Machine Learning and Inference Laboratory, George Mason University, 2008"},{"key":"9205_CR62","unstructured":"J.F. Miller. An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, Orlando, Florida, USA, 13\u201317 July 1999. (Morgan Kaufmann Publishers Inc., San Francisco) pp. 1135\u20131142"},{"key":"9205_CR63","doi-asserted-by":"crossref","unstructured":"J.F. Miller and P. Thomson. Cartesian genetic programming. In Genetic Programming, Proceedings of EuroGP\u20192000, volume 1802 of Lecture Notes in Computer Science, Edinburgh, UK, 15-16 April 2000. Springer, Berlin, pp121\u2013132","DOI":"10.1007\/978-3-540-46239-2_9"},{"key":"9205_CR64","unstructured":"D.J. Montana. Strongly typed genetic programming. BBN Technical Report #7866, Bolt Beranek and Newman, Inc., 10 Moulton Street, Cambridge, MA 02138, USA, 7 May 1993"},{"issue":"2","key":"9205_CR65","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1162\/evco.1995.3.2.199","volume":"3","author":"D.J. Montana","year":"1995","unstructured":"D.J. Montana, Strongly typed genetic programming. Evol. Comput. 3(2), 199\u2013230 (1995)","journal-title":"Evol. Comput."},{"key":"9205_CR66","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein, J. Bendisch, and H.-M. Voigt. From recombination of genes to the estimation of distributions: II. continuous parameters. In Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, volume 1141 of Lecture Notes in Computer Science, Berlin, Germany, 22-26 September 1996. (Springer, Berlin) pp. 188\u2013197","DOI":"10.1007\/3-540-61723-X_983"},{"key":"9205_CR67","doi-asserted-by":"crossref","unstructured":"H. M\u00fchlenbein and G. Paass. From recombination of genes to the estimation of distributions I. binary parameters. In Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, volume 1141 of Lecture Notes in Computer Science, Berlin, Germany, 22-26 September 1996. (Springer, Berlin) pp. 178\u2013187","DOI":"10.1007\/3-540-61723-X_982"},{"issue":"2","key":"9205_CR68","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TEVC.2006.871252","volume":"10","author":"X.H. Nguyen","year":"2006","unstructured":"X.H. Nguyen, R.I. McKay, D. Essam, Representation and structural difficulty in genetic programming. IEEE Trans. Evol. Comput. 10(2), 157\u2013166 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9205_CR69","unstructured":"P. Nordin. A compiling genetic programming system that directly manipulates the machine code. In Advances in genetic programming, chapter 14, pp. 311\u2013331. (MIT Press, Cambridge, 1994)"},{"key":"9205_CR70","unstructured":"P. Nordin and W. Banzhaf. Complexity compression and evolution. In Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), Pittsburgh, PA, USA, 15-19July 1995. (Morgan Kaufmann Publisher Inc., San Francisco), pp. 310\u2013317"},{"key":"9205_CR71","unstructured":"P. Nordin, F. Francone, and W. Banzhaf. Explicitly defined introns and destructive crossover in genetic programming. In Peter J. Angeline and K. E. Kinnear, Jr., editors, Advances in Genetic Programming 2, chapter 6. (MIT Press, Cambridge, 1996), pp. 111\u2013134"},{"key":"9205_CR72","doi-asserted-by":"crossref","unstructured":"J.L. Olmo, J. R. Romero, and S. Ventura. A grammar based ant programming algorithm for mining classification rules. In Proceedings of 2010 IEEE Congress on Evolutionary Computation (CEC 2010), Barcelona, Spain, 18\u201323 July 2010. IEEE Press, pages 225\u2013232","DOI":"10.1109\/CEC.2010.5586492"},{"key":"9205_CR73","doi-asserted-by":"crossref","unstructured":"O\u2019Neill M., Ryan C. (2001) Grammatical evolution. IEEE Trans. Evol. Comput. 5(4):349\u2013358","DOI":"10.1109\/4235.942529"},{"key":"9205_CR74","unstructured":"U.M. O\u2019Reilly. An Analysis of Genetic Programming. PhD thesis, Carleton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, 22 September 1995"},{"key":"9205_CR75","unstructured":"U.M. O\u2019Reilly. Investigating the generality of automatically defined functions. In Genetic Programming 1996: Proceedings of the First Annual Conference, Stanford University, CA, USA, 28\u201331 July 1996. MIT Press, pages 351\u2013356"},{"key":"9205_CR76","doi-asserted-by":"crossref","unstructured":"U.M. O\u2019Reilly and F. Oppacher. The troubling aspects of a building block hypothesis for genetic programming. In Foundations of Genetic Algorithms 3, Estes Park, Colorado, USA, 31 July\u20132 August 1994. Morgan Kaufmann Publishers Inc. Published 1995, pages 73\u201388","DOI":"10.1016\/B978-1-55860-356-1.50008-X"},{"issue":"1","key":"9205_CR77","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TEVC.2006.880327","volume":"11","author":"A. Ortega","year":"2007","unstructured":"A. Ortega, de la M. Cruz, M. Alfonseca, Christiansen grammar evolution: Grammatical evolution with semantics. IEEE Trans. Evol. Comput. 11(1), 77\u201390 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"10","key":"9205_CR78","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/TKDE.2009.191","volume":"22","author":"S.J. Pan","year":"2010","unstructured":"S.J. Pan, Q. Yang, A survey on transfer learning. IEEE Trans. Know. Data Eng. 22(10), 1345\u20131359 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9205_CR79","unstructured":"M. Pelikan. A simple implementation of bayesian optimization algorithm (boa) in C++ (version 1.0). Technical Report 99011, IlliGAL, University of Illinois at Urbana\u2013Champaign, 1999"},{"key":"9205_CR80","unstructured":"M. Pelikan. A C++ implementation of bayesian optimization algorithm with decision graphs. Technical Report 2000025, IlliGAL, University of Illinois at Urbana\u2013Champaign, 2000"},{"key":"9205_CR81","unstructured":"M. Pelikan. Implementation of the dependency-tree estimation of distribution algorithm in C++. Technical Report 2006010, IlliGAL, University of Illinois at Urbana\u2013Champaign, 2006"},{"key":"9205_CR82","unstructured":"M. Pelikan, D.E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2001), San Francisco, California, July 2001. Morgan Kaufmann Publishers Inc"},{"key":"9205_CR83","unstructured":"M. Pelikan, D. E. Goldberg, and E. Cantu-Paz. BOA: The Bayesian optimization algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume 1, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufamann, pp. 525\u2013532"},{"key":"9205_CR84","doi-asserted-by":"crossref","unstructured":"M. Pelikan, D. E. Goldberg, and F. G. Lobo. A survey of optimization by building and using probabilistic models. In Proceedings of the 2000 American Control Conference, volume 5, Baltimore, MD, USA, 28\u201330 June 2000, pages 3289\u20133293","DOI":"10.1109\/ACC.2000.879173"},{"issue":"1","key":"9205_CR85","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013500812258","volume":"21","author":"M. Pelikan","year":"2002","unstructured":"M. Pelikan, D.E. Goldberg, F.G. Lobo, A survey of optimization by building and using probabilistic models. Comput. Optim. Appl. 21(1), 5\u201320 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"9205_CR86","doi-asserted-by":"crossref","unstructured":"M. Pelikan, M. Hauschild, and P. Lanzi. Transfer learning, soft distance-based bias, and the hierarchical boa. In Parallel Problem Solving from Nature - PPSN XII, volume 7491 of Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012, pages 173\u2013183","DOI":"10.1007\/978-3-642-32937-1_18"},{"key":"9205_CR87","doi-asserted-by":"crossref","unstructured":"Poli R., Langdon W.B. (1998) Schema theory for genetic programming with one-point crossover and point mutation. Evol. Comput. 6(3):231\u2013252","DOI":"10.1162\/evco.1998.6.3.231"},{"key":"9205_CR88","doi-asserted-by":"crossref","unstructured":"R. Poli and N. F. McPhee. A linear estimation-of-distribution GP system. In Proceedings of the 11th European conference on Genetic Programming, EuroGP 2008, volume 4971 of Lecture Notes in Computer Science, Naples, Italy, 26-28 March 2008. (Springer, Berlin), p. 206\u2013217","DOI":"10.1007\/978-3-540-78671-9_18"},{"key":"9205_CR89","doi-asserted-by":"crossref","unstructured":"A. Ratle and M. Sebag. Avoiding the bloat with probabilistic grammar-guided genetic programming. In Artificial Evolution 5th International Conference, Evolution Artificielle, EA 2001, volume 2310 of Lecture Notes in Computer Science, Creusot, France, 29-31 October 2001. (Springer, Berlin), p. 255\u2013266","DOI":"10.1007\/3-540-46033-0_21"},{"key":"9205_CR90","volume-title":"Genetic algorithms : principles and perspectives ; a guide to GA theory","author":"C.R. Reeves","year":"2004","unstructured":"C.R. Reeves, J.E. Rowe, Genetic algorithms : principles and perspectives ; a guide to GA theory. (Kluwer, Netherland, 2004)"},{"key":"9205_CR91","doi-asserted-by":"crossref","unstructured":"E.N. Regolin, A.T.R. Pozo. Bayesian automatic programming. In Proceedings of the 8th European Conference on Genetic Programming, EuroGP 2005, volume 3447 of Lecture Notes in Computer Science, Lausane, Switzerland, 30 Mar\u20131 Apr 2005. (Springer, Berlin, p. 38\u201349)","DOI":"10.1007\/978-3-540-31989-4_4"},{"issue":"5","key":"9205_CR92","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen, Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"key":"9205_CR93","unstructured":"S.A. Rojas, P.J. Bentley. A grid-based ant colony system for automatic program synthesis. In Late Breaking Papers at the 2004 Genetic and Evolutionary Computation Conference, Seattle, Washington, USA, 26 July 2004"},{"key":"9205_CR94","unstructured":"J.P. Rosca. Analysis of complexity drift in genetic programming. In Genetic Programming 1997: Proceedings of the Second Annual Conference, Stanford University, CA, USA, 13-16 July 1997. Morgan Kaufmann Publishers Inc., pp. 286\u2013294"},{"key":"9205_CR95","unstructured":"J.P. Rosca, D.H. Ballard. Genetic programming with adaptive representations. Technical Report TR 489, University of Rochester, Computer Science Department, Rochester, NY, USA, February 1994"},{"key":"9205_CR96","unstructured":"O. Roux, C. Fonlupt. Ant programming: or how to use ants for automatic programming. In Proceedings of the Second International Conference on Ant Algorithms (ANTS2000), Brussels, Belgium, September 2000, p. 121\u2013129"},{"key":"9205_CR97","doi-asserted-by":"crossref","unstructured":"A. Salehi-Abari and T. White. Enhanced generalized ant programming (EGAP). In Proceedings of the 10th annual conference on Genetic and evolutionary computation(GECCO \u201910), Portland, Oregon, USA, 7-11 July 2008. ACM New York, pages 111\u2013118","DOI":"10.1145\/1389095.1389111"},{"issue":"2","key":"9205_CR98","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1162\/evco.1997.5.2.123","volume":"5","author":"R.P. Salustowicz","year":"1997","unstructured":"R.P. Salustowicz, J. Schmidh\u00fcber, Probabilistic incremental program evolution. Evol. Comput. 5(2), 123\u2013141 (1997)","journal-title":"Evol. Comput."},{"issue":"1","key":"9205_CR99","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1162\/1063656053583496","volume":"13","author":"R. Santana","year":"2005","unstructured":"R. Santana, Estimation of distribution algorithms with Kikuchi approximations. Evol. Comput. 13(1), 67\u201397 (2005)","journal-title":"Evol. Comput."},{"key":"9205_CR100","unstructured":"R. Santana, C. Echegoyen, A. Mendiburu, C. Bielza, J. A. Lozano, P. Larraaga, R. Armaanzas, and S. Shakya. Mateda: A suite of EDA programs in Matlab. Technical Report EHU-KZAA-IK-2\/09, University of the Basque Country, Feb 2009"},{"key":"9205_CR101","doi-asserted-by":"crossref","unstructured":"R. Santana, R.I. McKay, and J.A. Lozano. Symmetry in evolutionary and estimation of distribution algorithms. In IEEE Congress on Evolutionary Computation, page To Appear. IEEE Computational Intelligence Society, (IEEE Press, New York 2013)","DOI":"10.1109\/CEC.2013.6557811"},{"key":"9205_CR102","doi-asserted-by":"crossref","unstructured":"R. Santana, A. Mendiburu, and J.A. Lozano. Structural transfer using EDAs: An application to multi-marker tagging SNP selection. In 2012 IEEE Congress on Evolutionary Computation (CEC), p. 1\u20138, 2012","DOI":"10.1109\/CEC.2012.6252963"},{"key":"9205_CR103","unstructured":"K. Sastry, L. de la Ossa, F.G. Lobo. \u03c7\u2013ary extended compact genetic algorithm for matlab in C++. Technical Report 2006013, IlliGAL, University of Illinois at Urbana\u2013Champaign, 2006"},{"key":"9205_CR104","doi-asserted-by":"crossref","unstructured":"K. Sastry, D.E. Goldberg. Probabilistic model building and competent genetic programming. Genetic Programming Theory and Practise, p. 205\u2013220, 2003","DOI":"10.1007\/978-1-4419-8983-3_13"},{"key":"9205_CR105","unstructured":"Y. Shan, R.I. McKay, H.A. Abbass, D. Essam. Program evolution with explicit learning: a new framework for program automatic synthesis. In Proceedings of the 2003 IEEE Congress on Evolutionary Computation, CEC2003, pages 1639\u20131646, Canberra, Australia, 8-12 December 2003. University of New South Wales, IEEE Press, New York"},{"key":"9205_CR106","unstructured":"Y. Shan, R.I. McKay, R. Baxter, H. Abbass, D. Essam, H.X. Nguyen. Grammar model-based program evolution. In Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Portland, Oregon, USA, 20-23 June 2004. (IEEE Press, New York), p. 478\u2013485"},{"key":"9205_CR107","doi-asserted-by":"crossref","unstructured":"Y. Shan, R. I. McKay, D. Essam, and H. A. Abbass. A survey of probabilistic model building genetic programming. In Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, volume 33 of Studies in Computational Intelligence, chapter 6. (Springer, Berlin, 2006), p. 121\u2013160","DOI":"10.1007\/978-3-540-34954-9_6"},{"key":"9205_CR108","unstructured":"Y. Shan, R. I. McKay, D. Essam, and J. Liu. Modularity and position independence in EDA-GP. In Proceedings of The Second Asian-Pacific Workshop on Genetic Programming, Cairns, Australia, 2004"},{"key":"9205_CR109","doi-asserted-by":"crossref","unstructured":"Y. Shan, R. I. McKay, C. J. Lokan, and D. L. Essam. Software project effort estimation using genetic programming. In Proceedings of the IEEE 2002 International Conference on Communications, Circuits and Systems and West Sino Expositions, volume 2. IEEE, 2002, p. 1108\u20131112","DOI":"10.1109\/ICCCAS.2002.1178979"},{"issue":"1","key":"9205_CR110","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1162\/1063656053583414","volume":"13","author":"J.L. Shapiro","year":"2005","unstructured":"J.L. Shapiro, Drift and scaling in estimation of distribution algorithms. Evol. Comput. 13(1), 99\u2013123 (2005)","journal-title":"Evol. Comput."},{"key":"9205_CR111","doi-asserted-by":"crossref","unstructured":"J.L. Shapiro. Diversity loss in general estimation of distribution algorithms. In Parallel Problem Solving from Nature, volume 4193 of Lecture Notes in Computer Science, Reykjavik, Iceland, September 2006. Springer, pages 92\u2013101","DOI":"10.1007\/11844297_10"},{"issue":"5","key":"9205_CR112","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1002\/tee.20311","volume":"3","author":"S. Shirakawa","year":"2008","unstructured":"S. Shirakawa, S. Ogino, T. Nagao, Dynamic ant programming for automatic construction of programs. IEEJ Trans. Elect. Elect. Eng. 3(5), 540\u2013548 (2008)","journal-title":"IEEJ Transactions on Electrical and Electronic Engineering"},{"key":"9205_CR113","doi-asserted-by":"crossref","unstructured":"B. Su, Y. Shen. Maximum margin transfer learning. In Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation, GEC \u201909, New York, NY, USA, 2009. ACM, pages 957\u2013960","DOI":"10.1145\/1543834.1543983"},{"issue":"1","key":"9205_CR114","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10710-006-9008-4","volume":"8","author":"I. Tanev","year":"2007","unstructured":"I. Tanev, Genetic programming incorporating biased mutation for evolution and adaptation of snakebot. Genetic Programming and Evolvable Machines 8(1), 39\u201359 (2007)","journal-title":"Genet. Program Evolvable Mach."},{"key":"9205_CR115","unstructured":"A. Teller. Evolving programmers: The co-evolution of intelligent recombination operators. In Advances in Genetic Programming 2, chapter 3. (MIT Press, Cambridge, 1996), p. 45\u201368"},{"key":"9205_CR116","unstructured":"A. Teller, M. Veloso. PADO: Learning tree structured algorithms for orchestration into an object recognition system. Technical Report CMU-CS-95-101, Department of Computer Science, (Carnegie Mellon University, Pittsburgh, 1995)"},{"issue":"1","key":"9205_CR117","first-page":"71","volume":"13","author":"G.G. Towell","year":"1993","unstructured":"G.G. Towell, J.W. Shavlik, Extracting refined rules from knowledge-based neural networks. Mach. Learn. 13(1), 71\u2013101 (1993)","journal-title":"Mach Learn"},{"key":"9205_CR118","unstructured":"L.G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, volume 1, Los Angeles, CA, USA, August 1985. (Morgan Kaufmann Publisher Inc., Burlington), pp. 560\u2013566"},{"issue":"2","key":"9205_CR119","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C.S. Wallace","year":"1968","unstructured":"C.S. Wallace, D.M. Boulton, An information measure for classification. Comput. J. 11(2), 185\u2013194 (1968)","journal-title":"Comput. J."},{"key":"9205_CR120","unstructured":"P.A. Whigham. Grammatically-based genetic programming. In Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, p. 33\u201341, Tahoe City, California, USA, 9 July 1995"},{"key":"9205_CR121","doi-asserted-by":"crossref","unstructured":"P.A. Whigham. Inductive bias and genetic programming. In Proceedings of First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, Sheffield, UK, 12-14 September 1995. IEEE, p. 461\u2013466","DOI":"10.1049\/cp:19951092"},{"key":"9205_CR122","doi-asserted-by":"crossref","unstructured":"P.A. Whigham. A schema theorem for context-free grammars. In Proceedings of the 1995 IEEE Conference on Evolutionary Computation, volume 1, Perth, Austrailia, 29 November - 1 December 1995. (IEEE Press, New York) p. 178\u2013181","DOI":"10.1109\/ICEC.1995.489140"},{"key":"9205_CR123","unstructured":"P.A. Whigham. Grammatical bias for evolutionary learning. PhD thesis, School of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, Canberra, Australia, 1996"},{"key":"9205_CR124","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/3-540-60154-6_44","volume":"956","author":"P.A. Whigham","year":"1995","unstructured":"P.A. Whigham, R.I. McKay, Genetic approaches to learning recursive relations. Prog. Evol. Comput. 956, 17\u201327 (1995)","journal-title":"Prog Evol Comput"},{"issue":"2","key":"9205_CR125","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10710-007-9027-9","volume":"8","author":"G. Wilson","year":"2007","unstructured":"G. Wilson, M. Heywood, Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings. Genet. Program. Evolvable Mach. 8(2), 187\u2013220 (2007)","journal-title":"Genet. Program Evolvable Mach."},{"key":"9205_CR126","doi-asserted-by":"crossref","unstructured":"M.L. Wong and K. S. Leung. Applying logic grammars to induce sub-functions in genetic programming. In 1995 IEEE Conference on Evolutionary Computation, volume 2, Perth, Australia, 29 November - 1 December 1995. IEEE Press, pages 737\u2013740","DOI":"10.1109\/ICEC.1995.487477"},{"issue":"5","key":"9205_CR127","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/64.464935","volume":"10","author":"M.L. Wong","year":"1995","unstructured":"M.L. Wong, K.S. Leung, Genetic logic programming and applications. IEEE Expert 10(5), 68\u201376 (1995)","journal-title":"IEEE Expert"},{"key":"9205_CR128","doi-asserted-by":"crossref","unstructured":"M.L. Wong, K.S. Leung. An induction system that learns programs in different programming languages using genetic programming and logic grammars. In Proceedings of the 7th IEEE International Conference on Tools with Artificial Intelligence, Herndon, Virginia, USA, 5-8 November 1995","DOI":"10.1109\/TAI.1995.479782"},{"key":"9205_CR129","unstructured":"K. Yanai, H. Iba. Estimation of distribution programming based on Bayesian network. In Proceedings of the 2003 IEEE Congress on Evolutionary Computation, CEC2003, Canberra, Australia, 8-12 December 2003. IEEE Press, pages 1618\u20131625"},{"key":"9205_CR130","unstructured":"K. Yanai, H. Iba. Probabilistic model-building genetic programming based on dependency relationship. In Proceedings of The Second Asian-Pacific Workshop on Genetic Programming, Cairns, Australia, 6-7 December 2004"},{"key":"9205_CR131","doi-asserted-by":"crossref","unstructured":"K. Yanai, H. Iba. Program evolution by integrating EDP and GP. In Proceedings of Genetic and Evolutionary Computation\u2014GECCO-2004, Part I, volume 3102 of Lecture Notes in Computer Science, Seattle, WA, USA, 26-30 June 2004. Springer, pages 774\u2013785","DOI":"10.1007\/978-3-540-24854-5_78"},{"key":"9205_CR132","doi-asserted-by":"crossref","unstructured":"K. Yanai, H. Iba. Probabilistic distribution models for EDA-based GP. In GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, volume 2, Washington DC, USA, 25-29 June 2005. ACM Press, pages 1775\u20131776","DOI":"10.1145\/1068009.1068305"},{"issue":"1","key":"9205_CR133","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/B:ANOR.0000039526.52305.af","volume":"131","author":"M. Zlochin","year":"2004","unstructured":"M. Zlochin, M. Birattari, N. Meuleau, M. Dorigo, Model-based search for combinatorial optimization: A critical survey. Ann. Oper. Res. 131(1), 373\u2013395 (2004)","journal-title":"Ann. Oper. Res."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-013-9205-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-013-9205-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-013-9205-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T14:41:33Z","timestamp":1746024093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-013-9205-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,17]]},"references-count":133,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9205"],"URL":"https:\/\/doi.org\/10.1007\/s10710-013-9205-x","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2013,9,17]]}}}