{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:35:10Z","timestamp":1742938510942,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720681"},{"type":"electronic","value":"9783030720698"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72069-8_1","type":"book-chapter","created":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T18:02:55Z","timestamp":1627495375000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recent Developments of Automated Machine Learning and Search Techniques"],"prefix":"10.1007","author":[{"given":"Rong","family":"Qu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,29]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"M. Birattari, A. Ligot, G. Francesca, Automode: a modular approach to the automatic off-line design and fine-tuning of control software for robot swarms, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2021)","key":"1_CR1","DOI":"10.1007\/978-3-030-72069-8_5"},{"doi-asserted-by":"crossref","unstructured":"M. Birattari, Z. Yuan, P. Balaprakash, T. St\u00fctzle, F-race and iterated F-race: an overview, in Experimental Methods for the Analysis of Optimization Algorithms (2010), pp. 311\u2013336","key":"1_CR2","DOI":"10.1007\/978-3-642-02538-9_13"},{"doi-asserted-by":"crossref","unstructured":"H.J. Escalante, Automated machine learning - a brief review at the end of the early years, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2021)","key":"1_CR3","DOI":"10.1007\/978-3-030-72069-8_2"},{"doi-asserted-by":"crossref","unstructured":"I. Guyon, A.R.S.\u00a0Azar Alamdari, G. Dror, J.M. Buhmann, Performance prediction challenge, in Proceedings of the International Joint Conference on Neural Networks (IJCNN 2006) (Vancouver, BC, Canada, July, 2019), pp. 1649\u20131656","key":"1_CR4","DOI":"10.1109\/IJCNN.2006.246632"},{"doi-asserted-by":"crossref","unstructured":"F. Hutter, L. Kotthoff, J. Vanschoren (eds.), Automated Machine Learning: Methods, Systems, Challenges (Springer, 2019)","key":"1_CR5","DOI":"10.1007\/978-3-030-05318-5"},{"doi-asserted-by":"crossref","unstructured":"A. Lissovoi, P.S. Oliveto, J.A. Warwicker, Simple hyper-heuristics can control the neighbourhood size of randomized local search optimally for leading ones. Evolutionary Computation 28(3), 437\u2013461 (2020 September)","key":"1_CR6","DOI":"10.1162\/evco_a_00258"},{"unstructured":"Z. Liu, I. Guyon, J. Jacques Junior, M. Madadi, S. Escalera, A. Pavao, H.J. Escalante, W.-W. Tu, Z. Xu, S. Treguer, Autocv challenge design and baseline results, in In CAp 2019 - Conference sur l\u00c1pprentissage Automatique (July, 2019)","key":"1_CR7"},{"doi-asserted-by":"crossref","unstructured":"Y.\u00a0Mei, M.A. Ardeh, M. Zhang, Knowledge transfer in genetic programming hyper-heuristics, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2020)","key":"1_CR8","DOI":"10.1007\/978-3-030-72069-8_9"},{"unstructured":"W. Meng, R. Qu, A survey of learning in automated design of search algorithms, in IEEE Computational Intelligence Magazine, under review","key":"1_CR9"},{"doi-asserted-by":"crossref","unstructured":"M. Misir, Hyper-heuristics: autonomous problem solvers, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2020)","key":"1_CR10","DOI":"10.1007\/978-3-030-72069-8_7"},{"doi-asserted-by":"crossref","unstructured":"G. Ochoa, M. Hyde, T. Curtois, J.A. Vazquez-Rodriguez, J. Walker, M. Gendreau, G. Kendall, B. McCollum, A.J. Parkes, S. Petrovi, E.K. Burke, HyFlex: a benchmark framework for cross-domain heuristic search, in Proceedings of Evolutionary Computational Combinatorial Optimization (M\u00e1laga, April 11\u201313, 2012), pp. 136\u2013147","key":"1_CR11","DOI":"10.1007\/978-3-642-29124-1_12"},{"doi-asserted-by":"crossref","unstructured":"P.S. Oliveto, Rigorous performance analysis of hyper-heuristics, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2020)","key":"1_CR12","DOI":"10.1007\/978-3-030-72069-8_4"},{"doi-asserted-by":"crossref","unstructured":"N. Pillay, D. Beckedahl, EvoHyp - a Java toolkit for evolutionary algorithm hyper-heuristics, in Proceedings of IEEE Congress on Evolutionary Computation (San Sebastian, June 5-8, 2017), pp. 2707\u20132713","key":"1_CR13","DOI":"10.1109\/CEC.2017.7969636"},{"doi-asserted-by":"crossref","unstructured":"N. Pillay, T. Nyathi, Automated design of classification algorithms, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2020)","key":"1_CR14","DOI":"10.1007\/978-3-030-72069-8"},{"doi-asserted-by":"crossref","unstructured":"N. Pillay, R. Qu, Hyper-heuristics: Theory and Applications (Springer Nature, 2018)","key":"1_CR15","DOI":"10.1007\/978-3-319-96514-7"},{"doi-asserted-by":"crossref","unstructured":"N. Pillay, R. Qu, Assessing hyper-heuristic performance. J. Oper. Res. Soc. accepted (2020)","key":"1_CR16","DOI":"10.1080\/01605682.2020.1796538"},{"doi-asserted-by":"crossref","unstructured":"R. Poli, M. Graff, There is a free lunch for hyper-heuristics, genetic programming and computer scientists, in European Conference on Genetic Programming (Tubingen, April 15\u201317, 2009), pp. 195\u2013207","key":"1_CR17","DOI":"10.1007\/978-3-642-01181-8_17"},{"doi-asserted-by":"crossref","unstructured":"R. Qu, A general model for automated algorithm design, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer 2021)","key":"1_CR18","DOI":"10.1007\/978-3-030-72069-8_3"},{"doi-asserted-by":"crossref","unstructured":"R. Qu, G. Kendall, N. Pillay, The general combinatorial optimisation problem - towards automated algorithm design. IEEE Comput. Intell. Mag. 15, 14\u201323 (2020). May","key":"1_CR19","DOI":"10.1109\/MCI.2020.2976182"},{"doi-asserted-by":"crossref","unstructured":"C. Stone, E. Hart, B. Paechter, A cross-domain method for generation of constructive and perturbative heuristics, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2021)","key":"1_CR20","DOI":"10.1007\/978-3-030-72069-8_6"},{"unstructured":"T. St\u00fctzle, Automated algorithm configuration: advances and prospects, in Intelligent Distributed Computing VIII. Studies in Computational Intelligence, vol 570, ed. by D. Camacho, L. Braubach, S. Venticinque, C. Badica (Springer, Cham, 2015)","key":"1_CR21"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"D.H. Wolpert, W.G. McReady, No free lunch theorems for optimisation. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997). April","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"crossref","unstructured":"H. Zhu, Y. Jin. Towards real-time federated evolutionary neural architecture search, in Automated Design of Machine Learning and Search Algorithms, ed. by N. Pillay, R. Qu (Springer, 2021)","key":"1_CR23","DOI":"10.1109\/TEVC.2021.3099448"}],"container-title":["Natural Computing Series","Automated Design of Machine Learning and Search Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72069-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T19:38:29Z","timestamp":1672947509000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72069-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720681","9783030720698"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72069-8_1","relation":{},"ISSN":["1619-7127"],"issn-type":[{"type":"print","value":"1619-7127"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"29 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}