{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T10:01:43Z","timestamp":1756634503653,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030742508"},{"type":"electronic","value":"9783030742515"}],"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-74251-5_9","type":"book-chapter","created":{"date-parts":[[2021,4,12]],"date-time":"2021-04-12T15:20:40Z","timestamp":1618240840000},"page":"103-115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Incremental Search Space Construction for Machine Learning Pipeline Synthesis"],"prefix":"10.1007","author":[{"given":"Marc-Andr\u00e9","family":"Z\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Dung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco F.","family":"Huber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,13]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-40988-2_13","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"D Auger","year":"2013","unstructured":"Auger, D., Cou\u00ebtoux, A., Teytaud, O.: Continuous upper confidence trees with polynomial exploration \u2013 consistency. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8188, pp. 194\u2013209. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40988-2_13"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bergstra, J., Yamins, D., Cox, D.D.: Hyperopt: a Python library for optimizing the hyperparameters of machine learning algorithms. In: Python in Science Conference, pp. 13\u201320 (2013)","DOI":"10.25080\/Majora-8b375195-003"},{"key":"9_CR3","unstructured":"Bischl, B., et al.: OpenML benchmarking suites and the OpenML100. arXiv preprint arXiv:1708.03731v1 (2017)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Caruana, R., Niculescu-Mizil, A., Crew, G., Ksikes, A.: Ensemble selection from libraries of models. In: ICML, p. 18 (2004)","DOI":"10.1145\/1015330.1015432"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: 5th International Conference on Computer and Games (2006)","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"9_CR6","unstructured":"Drori, I., et al.: Automatic machine learning by pipeline synthesis using model-based reinforcement learning and a grammar. In: ICML (2019)"},{"key":"9_CR7","unstructured":"Feurer, M., Klein, A., Eggensperger, K., Springenber, J.T., Blum, M., Hutter, F.: Efficient and robust automated machine learning. In: NeurIPS, pp. 2755\u20132763 (2015)"},{"key":"9_CR8","unstructured":"Gijsbers, P., LeDell, E., Thomas, J., Poirier, S., Bischl, B., Vanschoren, J.: An open source AutoML benchmark. In: ICML (2019)"},{"key":"9_CR9","unstructured":"Gil, Y., et al.: P4ML: a phased performance-based pipeline planner for automated machine learning. In: ICML, pp. 1\u20138 (2018)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"9_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05318-5","volume-title":"Automated Machine Learning: Methods, Systems, Challenges","author":"F Hutter","year":"2018","unstructured":"Hutter, F., Kotthoff, L., Vanschoren, J.: Automated Machine Learning: Methods, Systems, Challenges. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05318-5"},{"key":"9_CR12","unstructured":"Kandasamy, K., Schneider, J., P\u00f3czos, B.: High dimensional Bayesian optimisation and bandits via additive models. In: ICML, pp. 295\u2013304 (2015)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Komer, B., Bergstra, J., Eliasmith, C.: Hyperopt-Sklearn: automatic hyperparameter configuration for Scikit-learn. In: ICML, pp. 2825\u20132830 (2014)","DOI":"10.25080\/Majora-14bd3278-006"},{"key":"9_CR14","first-page":"1","volume":"18","author":"L Li","year":"2018","unstructured":"Li, L., Jamieson, K.G., DeSalvo, G., Rostamizadeh, A., Talwalkar, A.: Hyperband: a novel bandit-based approach to hyperparameter optimization. JMLR 18, 1\u201352 (2018)","journal-title":"JMLR"},{"issue":"8","key":"9_CR15","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.: ML-Plan: automated machine learning via hierarchical planning. Mach. Learn. 107(8), 1495\u20131515 (2018). https:\/\/doi.org\/10.1007\/s10994-018-5735-z","journal-title":"Mach. Learn."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen, T.D., Maszczyk, T., Musial, K., Z\u00f6ller, M.A., Gabrys, B.: AVATAR - machine learning pipeline evaluation using surrogate model. In: IDA, pp. 352\u2013365 (2020)","DOI":"10.1007\/978-3-030-44584-3_28"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Olson, R.S., Moore, J.H.: TPOT: a tree-based pipeline optimization tool for automating machine learning. In: ICML, pp. 66\u201374 (2016)","DOI":"10.1145\/2908812.2908918"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-319-55696-3_16","volume-title":"Genetic Programming","author":"AGC de S\u00e1","year":"2017","unstructured":"de S\u00e1, A.G.C., Pinto, W.J.G.S., Oliveira, L.O.V.B., Pappa, G.L.: RECIPE: a grammar-based framework for automatically evolving classification pipelines. In: McDermott, J., Castelli, M., Sekanina, L., Haasdijk, E., Garc\u00eda-S\u00e1nchez, P. (eds.) EuroGP 2017. LNCS, vol. 10196, pp. 246\u2013261. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55696-3_16"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Swearingen, T., Drevo, W., Cyphers, B., Cuesta-Infante, A., Ross, A., Veeramachaneni, K.: ATM: a distributed, collaborative, scalable system for automated machine learning. In: IEEE BigData, pp. 151\u2013162 (2017)","DOI":"10.1109\/BigData.2017.8257923"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Thornton, C., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Auto-WEKA: combined selection and hyperparameter optimization of classification algorithms. In: ACM SIGKDD, pp. 847\u2013855 (2013)","DOI":"10.1145\/2487575.2487629"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/2641190.2641198","volume":"15","author":"J Vanschoren","year":"2014","unstructured":"Vanschoren, J., van Rijn, J.N., Bischl, B., Torgo, L.: OpenML: networked science in machine learning. ACM SIGKDD 15(2), 49\u201360 (2014)","journal-title":"ACM SIGKDD"},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1613\/jair.1.11854","volume":"70","author":"MA Z\u00f6ller","year":"2021","unstructured":"Z\u00f6ller, M.A., Huber, M.F.: Benchmark and survey of automated machine learning frameworks. JAIR 70, 409\u2013472 (2021)","journal-title":"JAIR"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-74251-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T00:26:41Z","timestamp":1619310401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-74251-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030742508","9783030742515"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-74251-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"13 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent Data Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ida2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ida2021.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}