{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:35:43Z","timestamp":1743075343185,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031295720"},{"type":"electronic","value":"9783031295737"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29573-7_11","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T13:03:02Z","timestamp":1680008582000},"page":"165-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Faster Convergence with\u00a0Lexicase Selection in\u00a0Tree-Based Automated Machine Learning"],"prefix":"10.1007","author":[{"given":"Nicholas","family":"Matsumoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil Kumar","family":"Saini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunjun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alena","family":"Orlenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leo-Pekka","family":"Lyytik\u00e4inen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jari O.","family":"Laurikka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Terho","family":"Lehtim\u00e4ki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra","family":"Batista","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason H.","family":"Moore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Burlacu, B., Affenzeller, M., Kommenda, M., Winkler, S., Kronberger, G.: Visualization of genetic lineages and inheritance information in genetic programming. In: Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 1351\u20131358 (2013)","DOI":"10.1145\/2464576.2482714"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ciesielski, V., Mawhinney, D.: Prevention of early convergence in genetic programming by replacement of similar programs. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 (Cat. No. 02TH8600), vol. 1, pp. 67\u201372. IEEE (2002)","DOI":"10.1109\/CEC.2002.1006211"},{"issue":"2","key":"11_CR3","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.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR4","series-title":"Advanced Information and Knowledge Processing","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/1-84628-137-7_6","volume-title":"Evolutionary Multiobjective Optimization","author":"K Deb","year":"2005","unstructured":"Deb, K., Thiele, L., Laumanns, M., Zitzler, E.: Scalable test problems for evolutionary multiobjective optimization. In: Abraham, A., Jain, L., Goldberg, R. (eds.) Evolutionary Multiobjective Optimization. Advanced Information and Knowledge Processing, pp. 105\u2013145. Springer, London (2005). https:\/\/doi.org\/10.1007\/1-84628-137-7_6"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1162\/089976698300017197","volume":"10","author":"T Dietterich","year":"1998","unstructured":"Dietterich, T.: Approximate statistical tests for comparing supervised classification learning algorithms. Neural Comput. 10, 1895\u20131923 (1998)","journal-title":"Neural Comput."},{"key":"11_CR6","first-page":"2171","volume":"13","author":"FA Fortin","year":"2012","unstructured":"Fortin, F.A., De Rainville, F.M., Gardner, M.A., Parizeau, M., Gagn\u00e9, C.: DEAP: evolutionary algorithms made easy. J. Mach. Learn. Res. 13, 2171\u20132175 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1109\/TEVC.2014.2362729","volume":"19","author":"T Helmuth","year":"2014","unstructured":"Helmuth, T., Spector, L., Matheson, J.: Solving uncompromising problems with lexicase selection. IEEE Trans. Evol. Comput. 19(5), 630\u2013643 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"La Cava, W., Moore, J.H.: An analysis of $$\\epsilon $$-lexicase selection for large-scale many- objective optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 185\u2013186 (2018)","DOI":"10.1145\/3205651.3205656"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"La Cava, W., Spector, L., Danai, K.: Epsilon-lexicase selection for regression. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 741\u2013748 (2016)","DOI":"10.1145\/2908812.2908898"},{"issue":"1","key":"11_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10710-021-09405-9","volume":"23","author":"WB Langdon","year":"2022","unstructured":"Langdon, W.B.: Genetic programming convergence. Genet. Program Evolvable Mach. 23(1), 71\u2013104 (2022)","journal-title":"Genet. Program Evolvable Mach."},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87, 198701 (2001). https:\/\/doi.org\/10.1103\/PhysRevLett.87.198701, https:\/\/link.aps.org\/doi\/10.1103\/PhysRevLett.87.198701","DOI":"10.1103\/PhysRevLett.87.198701"},{"key":"11_CR12","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-97088-2_5","volume-title":"Genetic Programming Theory and Practice XIV","author":"NF McPhee","year":"2018","unstructured":"McPhee, N.F., Finzel, M.D., Casale, M.M., Helmuth, T., Spector, L.: A detailed analysis of a PushGP run. In: Riolo, R., Worzel, B., Goldman, B., Tozier, B. (eds.) Genetic Programming Theory and Practice XIV. GEC, pp. 65\u201383. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97088-2_5"},{"key":"11_CR13","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-04735-1_7","volume-title":"Genetic Programming Theory and Practice XVI","author":"B Metevier","year":"2019","unstructured":"Metevier, B., Saini, A.K., Spector, L.: Lexicase selection beyond genetic programming. In: Banzhaf, W., Spector, L., Sheneman, L. (eds.) Genetic Programming Theory and Practice XVI. GEC, pp. 123\u2013136. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-04735-1_7"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-43488-9_15","volume-title":"From Animals to Animats 14","author":"JM Moore","year":"2016","unstructured":"Moore, J.M., McKinley, P.K.: A comparison of multiobjective algorithms in evolving quadrupedal gaits. In: Tuci, E., Giagkos, A., Wilson, M., Hallam, J. (eds.) SAB 2016. LNCS (LNAI), vol. 9825, pp. 157\u2013169. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43488-9_15"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Oh, H., et al.: Convergence-aware neural network training. In: 2020 57th ACM\/IEEE Design Automation Conference (DAC), pp. 1\u20136. IEEE (2020)","DOI":"10.1109\/DAC18072.2020.9218518"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-31204-0_9","volume-title":"Applications of Evolutionary Computation","author":"RS Olson","year":"2016","unstructured":"Olson, R.S., Urbanowicz, R.J., Andrews, P.C., Lavender, N.A., Kidd, L.C., Moore, J.H.: Automating biomedical data science through tree-based pipeline optimization. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016. LNCS, vol. 9597, pp. 123\u2013137. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31204-0_9"},{"issue":"6","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1093\/bioinformatics\/btz796","volume":"36","author":"A Orlenko","year":"2020","unstructured":"Orlenko, A., et al.: Model selection for metabolomics: predicting diagnosis of coronary artery disease using automated machine learning. Bioinformatics 36(6), 1772\u20131778 (2020)","journal-title":"Bioinformatics"},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Orzechowski, P., Moore, J.H.: Generative and reproducible benchmarks for comprehensive evaluation of machine learning classifiers. Sci. Adv. 8(47), eabl4747 (2022). https:\/\/doi.org\/10.1126\/sciadv.abl4747, https:\/\/www.science.org\/doi\/abs\/10.1126\/sciadv.abl4747","DOI":"10.1126\/sciadv.abl4747"},{"issue":"4","key":"11_CR19","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10710-021-09417-5","volume":"22","author":"AK Saini","year":"2021","unstructured":"Saini, A.K., Spector, L.: Relationships between parent selection methods, looping constructs, and success rate in genetic programming. Genet. Program Evolvable Mach. 22(4), 495\u2013509 (2021)","journal-title":"Genet. Program Evolvable Mach."},{"key":"11_CR20","unstructured":"Snedecor, G.W., Cochran, W.G.: Statistical Methods, 8th edn. Iowa State University Press (1989)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29573-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T05:50:49Z","timestamp":1729144249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29573-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031295720","9783031295737"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29573-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/eurogp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"38","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":"14","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":"8","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":"37% - 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":"2.95","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":"2.9","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)"}}]}}