The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Evaluation of a Tree-based Pipeline Optimization Tool for Automating Data Science
Open accessAbstract
As the field of data science continues to grow, there will be an ever-increasing demand for tools that make machine learning accessible to non-experts. In this paper, we introduce the concept of tree-based pipeline optimization for automating one of the most tedious parts of machine learning--pipeline design. We implement an open source Tree-based Pipeline Optimization Tool (TPOT) in Python and demonstrate its effectiveness on a series of simulated and real-world benchmark data sets. In particular, we show that TPOT can design machine learning pipelines that provide a significant improvement over a basic machine learning analysis while requiring little to no input nor prior knowledge from the user. We also address the tendency for TPOT to design overly complex pipelines by integrating Pareto optimization, which produces compact pipelines without sacrificing classification accuracy. As such, this work represents an important step toward fully automating machine learning pipeline design.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
A fast and elitist multiobjective genetic algorithm: NSGA-II
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.996017 · Cited by 50,053
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
Scikit-learn: Machine Learning in Python
(2011) · Journal of Machine Learning Research · doi:10.5555/1953048.2078195 · Cited by 8,539
(2012) · Cited by 8,009
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
Banzhaf, W., Francone, F. D., Keller, R. E., & Nordin, P. C. (1998) · Cited by 1,678
DEAP: evolutionary algorithms made easy
Fortin, F.-A., Rainville, F.-M. D., Gardner, M.-A., Parizeau, M., & Gagné, C. (2012) · Cited by 1,642
(2015) · neural information processing systems · Cited by 1,305
Genetic Programming: An Introduction
Banzhaf, W., Keller, R. E., & Nordin, P. C. (1997) · Cited by 1,052
Deep feature synthesis: Towards automating data science endeavors
Kanter, J. M., & Veeramachaneni, K. (2015) · 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2015.7344858 · Cited by 421
Velez, D. R., White, B. C., Motsinger, A. A., Bush, W. S., Ritchie, M. D., Williams, S. M., & Moore, J. H. (2007) · Genetic Epidemiology · doi:10.1002/gepi.20211 · Cited by 384
Self-citationA randomized algorithm for the decomposition of matrices
Martinsson, P.-G., Rokhlin, V., & Tygert, M. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.02.003 · Cited by 352
Automating Biomedical Data Science Through Tree-Based Pipeline Optimization
Olson, R. S., Urbanowicz, R. J., Andrews, P. C., Lavender, N. A., Kidd, L. C., & Moore, J. H. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-31204-0_9 · Cited by 329
Self-citationA genetic programming approach to automated software repair
Forrest, S., Nguyen, T., Weimer, W., & Le Goues, C. (2009) · Proceedings of the 11th Annual conference on Genetic and evolutionary computation · doi:10.1145/1569901.1570031 · Cited by 236
Urbanowicz, R. J., Kiralis, J., Sinnott-Armstrong, N. A., Heberling, T., Fisher, J. M., & Moore, J. H. (2012) · BioData Mining · doi:10.1186/1756-0381-5-16 · Cited by 221
Self-citationBeyond Manual Tuning of Hyperparameters
Hutter, F., Lücke, J., & Schmidt-Thieme, L. (2015) · KI - Künstliche Intelligenz · doi:10.1007/s13218-015-0381-0 · Cited by 215
Computer-Automated Evolution of an X-Band Antenna for NASA's Space Technology 5 Mission
Hornby, G. S., Lohn, J. D., & Linden, D. S. (2010) · Evolutionary Computation · doi:10.1162/evco_a_00005 · Cited by 110
Genetic programming for finite algebras
Spector, L. C., Clark, D. M., Lindsay, I., Barr, B., & Klein, J. (2008) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1389095.1389343 · Cited by 65
Predicting the difficulty of pure, strict, epistatic models: metrics for simulated model selection
Urbanowicz, R. J., Kiralis, J., Fisher, J. M., & Moore, J. H. (2012) · BioData Mining · doi:10.1186/1756-0381-5-15 · Cited by 36
Self-citationExploring automated software composition with genetic programming
Fredericks, E. M., & Cheng, B. H. C. (2013) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/2464576.2480790 · Cited by 8
Cited by
Automated Machine Learning: Methods, Systems, Challenges
(2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5 · Cited by 1,485
Feurer, M., & Hutter, F. (2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5_1 · Cited by 1,414
Hyperparameter optimization: Foundations, algorithms, best practices, and open challenges
Bischl, B., Binder, M., Lang, M., Pielok, T., Richter, J., Coors, S., Thomas, J., Ullmann, T., Becker, M., Boulesteix, A., et al. (2023) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1484 · Cited by 930
Auto-Keras: An Efficient Neural Architecture Search System
Jin, H., Song, Q., & Hu, X. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330648 · Cited by 891
Predicting response to cancer immunotherapy using noninvasive radiomic biomarkers
Trebeschi, S., Drago, S. G., Birkbak, N. J., Kurilova, I., Cǎlin, A. M., Delli Pizzi, A., Lalezari, F., Lambregts, D. M. J., Rohaan, M. W., Parmar, C., et al. (2019) · Annals of Oncology · doi:10.1093/annonc/mdz108 · Cited by 566
Metadata
- Authors
- Olson, R. S., Bartley, N., Urbanowicz, R. J., & Moore, J. H.
- Venue
- Proceedings of the Genetic and Evolutionary Computation Conference 2016
- Publisher
- ACM
- Published
- 2016-07-20
- Pages
- 485-492
- OpenAlex
- W2309832917
- Cited by
- 595
- References
- 23
- FWCI
- 18.15
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.