{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T18:44:59Z","timestamp":1777401899709,"version":"3.51.4"},"reference-count":47,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1109\/cec.2014.6900455","type":"proceedings-article","created":{"date-parts":[[2014,9,29]],"date-time":"2014-09-29T21:35:57Z","timestamp":1412026557000},"page":"149-158","source":"Crossref","is-referenced-by-count":9,"title":["The sampling-and-learning framework: A statistical view of evolutionary algorithms"],"prefix":"10.1109","author":[{"given":"Yang","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"2004","article-title":"An analysis of evolutionary algorithms for finding approximation solutions to hard optimisation problems","author":"he","year":"2003","journal-title":"Proceedings of 2003 IEEE Congress on Evolutionary Computation (CEC'03)"},{"key":"35","first-page":"54","article-title":"Fitness landscapes based on sorting and shortest paths problems","author":"scharnow","year":"2002","journal-title":"Proceedings of the 7th International Conference on Parallel Problem Solving from Nature (PPSN'02)"},{"key":"17","author":"goldberg","year":"1989","journal-title":"Genetic Algorithms in Search Optimization and Machine Learning"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2008.16.4.557"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00058-3"},{"key":"33","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.artint.2013.09.002","article-title":"An analysis on recombination in multiobjective evolutionary optimization","volume":"204","author":"qian","year":"2013","journal-title":"Artificial Intelligence"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9391-3"},{"key":"34","author":"rubinstein","year":"2004","journal-title":"The Cross-Entropy Method A Unified Approach to Combinatorial Optimization Monte-Carlo Simulation and Machine Learning"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00003"},{"key":"39","first-page":"2388","article-title":"Multi-view active learning in the nonrealizable case","volume":"23","author":"wang","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"14","first-page":"973","article-title":"The foundations of cost-sensitive learning","author":"elkan","year":"2001","journal-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01)"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2012.2202241"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"38","article-title":"A parameterized runtime analysis of evolutionary algorithms for the euclidean traveling salesperson problem","author":"sutton","year":"2012","journal-title":"Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI'12)"},{"key":"12","first-page":"253","article-title":"A new framework for the valuation of algorithms for black-box optimization","author":"droste","year":"2002","journal-title":"Proceedings of the 7th ACM SIGEVO International Workshop on Foundations of Genetic Algorithms (FOGA'02)"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1162\/106365605774666921"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17339-4"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.01.001"},{"key":"42","first-page":"60","article-title":"Unpacking and understanding evolutionary algorithms","author":"yao","year":"2012","journal-title":"Advances in Computational Intelligence Volume 7311 of Lecture Notes in Computer Science"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585893"},{"key":"40","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","article-title":"Population size versus runtime of a simple evolutionary algorithm","volume":"403","author":"witt","year":"2008","journal-title":"Theoretical Computer Science"},{"key":"45","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.01.010"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.07.001"},{"key":"47","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000039526.52305.af"},{"key":"46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.17"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0940-2"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330347"},{"key":"24","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","author":"kearns","year":"1994","journal-title":"An Introduction to Computational Learning Theory"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/BF00175355"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9660-4"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2291790"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1539-5"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","author":"back","year":"1996","journal-title":"Evolutionary Algorithms in Theory and Practice Evolution Strategies Evolutionary Programming Genetic Algorithms"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1142\/7438"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20712-9_2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527135"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9616-8"},{"key":"7","first-page":"281","article-title":"Analysis of perceptronbased active learning","volume":"10","author":"dasgupta","year":"2009","journal-title":"Journal of Machine Learning Research"},{"key":"6","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1109\/TSMCB.2008.2012167","article-title":"A new approach for analyzing average time complexity of population-based evolutionary algorithms on unimodal problems","volume":"39","author":"chen","year":"2009","journal-title":"IEEE Transactions on Systems Man and Cybernetics Part B Cybernetics"},{"key":"32","author":"neumann","year":"2010","journal-title":"Bioinspired Computation in Combinatorial Optimization-Algorithms and Their Computational Complexity"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015059928466"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89694-4_60"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488613"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9622-x"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.059"}],"event":{"name":"2014 IEEE Congress on Evolutionary Computation (CEC)","location":"Beijing, China","start":{"date-parts":[[2014,7,6]]},"end":{"date-parts":[[2014,7,11]]}},"container-title":["2014 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6880677\/6900223\/06900455.pdf?arnumber=6900455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T08:07:06Z","timestamp":1650269226000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6900455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/cec.2014.6900455","relation":{},"subject":[],"published":{"date-parts":[[2014,7]]}}}