{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T09:53:20Z","timestamp":1773741200009,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T00:00:00Z","timestamp":1664409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T00:00:00Z","timestamp":1664409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB901"],"award-info":[{"award-number":["SFB901"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010628","name":"University of La Sabana","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010628","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2023,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An essential task of automated machine learning (<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\text {AutoML}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mtext>AutoML<\/mml:mtext>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>) is the problem of automatically finding the pipeline with the best generalization performance on a given dataset. This problem has been addressed with sophisticated <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\text {black-box}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mtext>black-box<\/mml:mtext>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> optimization techniques such as Bayesian optimization, grammar-based genetic algorithms, and tree search algorithms. Most of the current approaches are motivated by the assumption that optimizing the components of a pipeline in isolation may yield sub-optimal results. We present <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\text {Naive AutoML}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mtext>Naive AutoML<\/mml:mtext>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, an approach that precisely realizes such an in-isolation optimization of the different components of a pre-defined pipeline scheme. The returned pipeline is obtained by just taking the best algorithm of each slot. The isolated optimization leads to substantially reduced search spaces, and, surprisingly, this approach yields comparable and sometimes even better performance than current state-of-the-art optimizers.<\/jats:p>","DOI":"10.1007\/s10994-022-06200-0","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T19:07:50Z","timestamp":1664478470000},"page":"1131-1170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Naive automated machine learning"],"prefix":"10.1007","volume":"112","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9293-2424","authenticated-orcid":false,"given":"Felix","family":"Mohr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcel","family":"Wever","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,29]]},"reference":[{"issue":"1","key":"6200_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"SP Boyd","year":"2011","unstructured":"Boyd, S. P., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and Trends in Machine Learning, 3(1), 1\u2013122.","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"2","key":"6200_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF00058655","volume":"24","author":"L Breiman","year":"1996","unstructured":"Breiman, L. (1996). Bagging predictors. Machine Learning, 24(2), 123\u2013140.","journal-title":"Machine Learning"},{"issue":"1","key":"6200_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"key":"6200_CR4","unstructured":"Cachada, M., Abdulrahman, S.M., & Brazdil, P. (2017) Combining feature and algorithm hyperparameter selection using some metalearning methods. In Proceedings of the international workshop on AutoML@PKDD\/ECML 2017 (pp. 69\u201383)"},{"key":"6200_CR5","doi-asserted-by":"crossref","unstructured":"Chen, B., Wu, H., Mo, W., Chattopadhyay, I., & Lipson, H. (2018). Autostacker: A compositional evolutionary learning system. In Proceedings of the genetic and evolutionary computation conference (pp. 402\u2013409)","DOI":"10.1145\/3205455.3205586"},{"key":"6200_CR6","doi-asserted-by":"crossref","unstructured":"Crisan, A., & Fiore-Gartland, B. (2021). Fits and starts: Enterprise use of automl and the role of humans in the loop. CoRR abs\/2101.04296.","DOI":"10.1145\/3411764.3445775"},{"key":"6200_CR35","doi-asserted-by":"crossref","unstructured":"de\u00a0S\u00e1, A.G., Pinto, W.J.G., Oliveira, L.O.V., & Pappa, G.L. (2017). RECIPE: a grammar-based framework for automatically evolving classification pipelines. In European Conference on Genetic Programming (pp. 246\u2013261). Springer.","DOI":"10.1007\/978-3-319-55696-3_16"},{"issue":"2","key":"6200_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6200_CR8","doi-asserted-by":"crossref","unstructured":"Drozdal, J., Weisz, J.D., Wang, D., Dass, G., Yao, B., Zhao, C., Muller, M.J., Ju, L., & Su, H. (2020). Trust in AutoML: exploring information needs for establishing trust in automated machine learning systems. In IUI \u201920: 25th International conference on intelligent user interfaces (pp. 297\u2013307). ACM","DOI":"10.1145\/3377325.3377501"},{"key":"6200_CR9","unstructured":"Engels, R. (1996). Planning tasks for knowledge discovery in databases; performing task-oriented user-guidance. In Proceedings of the second international conference on knowledge discovery and data mining (KDD-96) (pp 170\u2013175). AAAI Press."},{"key":"6200_CR10","unstructured":"Erickson, N., Mueller, J., Shirkov, A., Zhang, H., Larroy, P., Li, M., & Smola, A. J. (2020). AutoGluon-Tabular: Robust and Accurate AutoML for Structured Data. CoRR abs\/2003.06505."},{"key":"6200_CR11","first-page":"405","volume":"10","author":"HJ Escalante","year":"2009","unstructured":"Escalante, H. J., Montes-y-G\u00f3mez, M., & Sucar, L. E. (2009). Particle swarm model selection. Journal of Machine Learning Research, 10, 405\u2013440.","journal-title":"Journal of Machine Learning Research"},{"key":"6200_CR12","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenberg, J., Blum, M., & Hutter, F. (2015). Efficient and robust automated machine learning. In Advances in Neural Information Processing Systems (pp. 2962\u20132970)."},{"key":"6200_CR13","unstructured":"Fusi, N., Sheth, R., & Elibol, M. (2018). Probabilistic matrix factorization for automated machine learning. In: Advances in Neural Information Processing Systems (pp. 3352\u20133361)."},{"key":"6200_CR14","unstructured":"Gijsbers, P., LeDell, E., Thomas, J., Poirier, S., Bischl, B., & Vanschoren, J. (2019). An open source automl benchmark. CoRR abs\/1907.00909."},{"issue":"33","key":"6200_CR15","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.21105\/joss.01132","volume":"4","author":"P Gijsbers","year":"2019","unstructured":"Gijsbers, P., & Vanschoren, J. (2019). GAMA: genetic automated machine learning assistant. Journal of Open Source Software, 4(33), 1132.","journal-title":"Journal of Open Source Software"},{"key":"6200_CR16","doi-asserted-by":"crossref","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I.H. (2009). The WEKA data mining software: an update. ACM SIGKDD Explorations 11","DOI":"10.1145\/1656274.1656278"},{"key":"6200_CR17","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011). Sequential model-based optimization for general algorithm configuration, 6683, 507\u2013523.","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"6200_CR18","unstructured":"Jamieson, K., & Talwalkar, A. (2016). Non-stochastic best arm identification and hyperparameter optimization. In Artificial Intelligence and Statistics, AISTATS\u201916 (pp. 240\u2013248)."},{"key":"6200_CR19","first-page":"81:1","volume":"21","author":"K Kandasamy","year":"2020","unstructured":"Kandasamy, K., Vysyaraju, K. R., Neiswanger, W., Paria, B., Collins, C. R., Schneider, J., et al. (2020). Tuning hyperparameters without grad students: Scalable and robust Bayesian optimisation with dragonfly. Journal of Machine Learning Research, 21, 81:1-81:27.","journal-title":"Journal of Machine Learning Research"},{"key":"6200_CR20","unstructured":"Kietz, J., Serban, F., Bernstein, A., & Fischer, S. (2009). Towards cooperative planning of data mining workflows. In Proceedings of the third generation data mining workshop at the 2009 European conference on machine learning (pp. 1\u201312). Citeseer"},{"key":"6200_CR21","unstructured":"Kietz, J.U., Serban, F., Bernstein, A., & Fischer, S. (2012). Designing KDD-workflows via HTN-planning for intelligent discovery assistance. In: 5th planning to learn workshop WS28 at ECAI 2012 (p.\u00a010)."},{"key":"6200_CR22","doi-asserted-by":"crossref","unstructured":"Kishimoto, A., Bouneffouf, D., Marinescu, R., Ram, P., Rawat, A., Wistuba, M., Palmes, P.P., & Botea, A. (2021). Bandit limited discrepancy search and application to machine learning pipeline optimization. In 8th ICML workshop on automated machine learning (AutoML)","DOI":"10.1609\/aaai.v36i9.21263"},{"issue":"1","key":"6200_CR23","first-page":"826","volume":"18","author":"L Kotthoff","year":"2017","unstructured":"Kotthoff, L., Thornton, C., Hoos, H. H., Hutter, F., & Leyton-Brown, K. (2017). Auto-weka 2.0: Automatic model selection and hyperparameter optimization in weka. Journal of Machine Learning Research, 18(1), 826\u2013830.","journal-title":"Journal of Machine Learning Research"},{"key":"6200_CR24","first-page":"185:1","volume":"18","author":"L Li","year":"2017","unstructured":"Li, L., Jamieson, K. G., DeSalvo, G., Rostamizadeh, A., & Talwalkar, A. (2017). Hyperband: A novel bandit-based approach to hyperparameter optimization. Journal of Machine Learning Research, 18, 185:1-185:52.","journal-title":"Journal of Machine Learning Research"},{"key":"6200_CR25","unstructured":"Lindauer, M., Eggensperger, K., Feurer, M., Biedenkapp, A., Marben, J., M\u00fcller, P., & Hutter, F. (2019). BOAH: A tool suite for multi-fidelity Bayesian optimization & analysis of hyperparameters. CoRR abs\/1908.06756."},{"key":"6200_CR26","doi-asserted-by":"publisher","first-page":"4892","DOI":"10.1609\/aaai.v34i04.5926","volume":"34","author":"S Liu","year":"2020","unstructured":"Liu, S., Ram, P., Vijaykeerthy, D., Bouneffouf, D., Bramble, G., Samulowitz, H., et al. (2020). An ADMM based framework for AutoML pipeline configuration. Proceedings of the AAAI Conference on Artificial Intelligence, 34, 4892\u20134899.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"6200_CR27","doi-asserted-by":"crossref","unstructured":"Mohr, F., & Wever, M. (2021). Replacing the ex-def Baseline in AutoML by Naive AutoML. In: 8th ICML workshop on automated machine learning (AutoML).","DOI":"10.1007\/s10994-022-06200-0"},{"issue":"8","key":"6200_CR28","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1007\/s10994-018-5735-z","volume":"107","author":"F Mohr","year":"2018","unstructured":"Mohr, F., Wever, M., & H\u00fcllermeier, E. (2018). ML-Plan: Automated machine learning via hierarchical planning. Machine Learning, 107(8), 1495\u20131515.","journal-title":"Machine Learning"},{"key":"6200_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPAMI.2021.3056950","volume":"43","author":"F Mohr","year":"2021","unstructured":"Mohr, F., Wever, M., Tornede, A., & H\u00fcllermeier, E. (2021). Predicting machine learning pipeline runtimes in the context of automated machine learning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 43, 1\u20131.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6200_CR30","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1613\/jair.4377","volume":"51","author":"P Nguyen","year":"2014","unstructured":"Nguyen, P., Hilario, M., & Kalousis, A. (2014). Using meta-mining to support data mining workflow planning and optimization. Journal of Artificial Intelligence Research, 51, 605\u2013644.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6200_CR31","unstructured":"Nguyen, P., Kalousis, A., & Hilario, M. (2012). Experimental evaluation of the e-lico meta-miner. In: 5th planning to learn workshop WS28 at ECAI (pp. 18\u201319)."},{"key":"6200_CR32","doi-asserted-by":"crossref","unstructured":"Olson, R.S., & Moore, J.H. (2019). TPOT: A tree-based pipeline optimization tool for automating machine learning. In Automated machine learning: Methods, systems, challenges, The Springer series on challenges in machine learning (pp. 151\u2013160). Springer","DOI":"10.1007\/978-3-030-05318-5_8"},{"key":"6200_CR33","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., et al. (2011). Scikit-learn: Machine learning in python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"key":"6200_CR34","doi-asserted-by":"crossref","unstructured":"Rakotoarison, H., Schoenauer, M., & Sebag, M. (2019). Automated machine learning with monte-carlo tree search. In Proceedings of the twenty-eighth international joint conference on artificial intelligence (pp. 3296\u20133303). https:\/\/www.ijcai.org\/.","DOI":"10.24963\/ijcai.2019\/457"},{"issue":"7\u20138","key":"6200_CR36","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.ijmedinf.2005.05.002","volume":"74","author":"AR Statnikov","year":"2005","unstructured":"Statnikov, A. R., Tsamardinos, I., Dosbayev, Y., & Aliferis, C. F. (2005). GEMS: A system for automated cancer diagnosis and biomarker discovery from microarray gene expression data. International Journal of Medical Informatics, 74(7\u20138), 491\u2013503.","journal-title":"International Journal of Medical Informatics"},{"key":"6200_CR37","doi-asserted-by":"crossref","unstructured":"Thornton, C., Hutter, F., Hoos, H.H., & Leyton-Brown, K. (2013). Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms. In The 19th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 847\u2013855).","DOI":"10.1145\/2487575.2487629"},{"key":"6200_CR38","doi-asserted-by":"crossref","unstructured":"Vanschoren, J. (2019). Meta-learning. In Automated machine learning - methods, systems, challenges, The Springer series on challenges in machine learning (pp. 35\u201361). Springer.","DOI":"10.1007\/978-3-030-05318-5_2"},{"issue":"2","key":"6200_CR39","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2013","unstructured":"Vanschoren, J., van Rijn, J. N., Bischl, B., & Torgo, L. (2013). OpenML: Networked science in machine learning. SIGKDD Explorations, 15(2), 49\u201360.","journal-title":"SIGKDD Explorations"},{"key":"6200_CR40","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0893-6080(05)80023-1","volume":"5","author":"DH Wolpert","year":"1992","unstructured":"Wolpert, D. H. (1992). Stacked generalization. Neural Networks, 5, 241\u2013259.","journal-title":"Neural Networks"},{"key":"6200_CR41","doi-asserted-by":"crossref","unstructured":"Yang, C., Akimoto, Y., Kim, D.W., & Udell, M. (2019). OBOE: Collaborative filtering for AutoML model selection. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (pp. 1173\u20131183).","DOI":"10.1145\/3292500.3330909"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06200-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-022-06200-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-022-06200-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T05:11:34Z","timestamp":1679893894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-022-06200-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,29]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["6200"],"URL":"https:\/\/doi.org\/10.1007\/s10994-022-06200-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,29]]},"assertion":[{"value":"3 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Eyke H\u00fcllermeier","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}}]}}