The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
evtree: Evolutionary Learning of Globally Optimal Classification and Regression Trees in R
Open accessAbstract
Commonly used classification and regression tree methods like the CART algorithm are recursive partitioning methods that build the model in a forward stepwise search. Although this approach is known to be an efficient heuristic, the results of recursive tree methods are only locally optimal, as splits are chosen to maximize homogeneity at the next step only. An alternative way to search over the parameter space of trees is to use global optimization methods like evolutionary algorithms. This paper describes the evtree package, which implements an evolutionary algorithm for learning globally optimal classification and regression trees in R. Computationally intensive tasks are fully computed in C++ while the partykit package is leveraged for representing the resulting trees in R, providing unified infrastructure for summaries, visualizations, and predictions. evtree is compared to the open-source CART implementation rpart, conditional inference trees (ctree), and the open-source C4.5 implementation J48. A benchmark study of predictive accuracy and complexity is carried out in which evtree achieved at least similar and most of the time better results compared to rpart, ctree, and J48. Furthermore, the usefulness of evtree in practice is illustrated in a textbook customer classification task.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Unbiased Recursive Partitioning: A Conditional Inference Framework
Hothorn, T., Hornik, K., & Zeileis, A. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x133933 · Cited by 4,021
Self-citationAn empirical comparison of supervised learning algorithms
Caruana, R., & Niculescu-Mizil, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143865 · Cited by 2,780
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
Cited by
An extensive experimental survey of regression methods
Fernández-Delgado, M., Sirsat, M. S., Cernadas, E., Alawadi, S., Barro, S., & Febrero-Bande, M. (2019) · Neural Networks · doi:10.1016/j.neunet.2018.12.010 · Cited by 377
Stacking Ensemble Learning for Short-Term Electricity Consumption Forecasting
Divina, F., Gilson, A., Goméz-Vela, F., García Torres, M., & Torres, J. (2018) · Energies · doi:10.3390/en11040949 · Cited by 299
Automatic hourly solar forecasting using machine learning models
Yagli, G. M., Yang, D., & Srinivasan, D. (2019) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2019.02.006 · Cited by 278
Rudiyanto, Minasny, B., Setiawan, B. I., Saptomo, S. K., & McBratney, A. B. (2018) · Geoderma · doi:10.1016/j.geoderma.2017.10.018 · Cited by 143
Automobile insurance classification ratemaking based on telematics driving data
Huang, Y., & Meng, S. (2019) · Decision Support Systems · doi:10.1016/j.dss.2019.113156 · Cited by 119
Metadata
- Authors
- Grubinger, T., Zeileis, A., & Pfeiffer, K.-P.
- Venue
- Journal of Statistical Software
- Publisher
- Foundation for Open Access Statistic
- Published
- 2014
- Volume
- 61
- Issue
- 1
- ISSN
- 1548-7660 (ISSN-L)
- OpenAlex
- W2161062919
- Cited by
- 159
- References
- 4
- FWCI
- 30.51
- Type
- journal article
- Language
- en
- Open access
- diamond
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: evtree: Evolutionary Learning of Globally Optimal Classification and Regression Trees in R. https://app.cochat.ai/papers/10.18637/jss.v061.i01
- The paper
- Grubinger, T., Zeileis, A., & Pfeiffer, K.-P. (2014). evtree: Evolutionary Learning of Globally Optimal Classification and Regression Trees in R. Journal of Statistical Software. https://doi.org/10.18637/jss.v061.i01
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.