evtree: Evolutionary Learning of Globally Optimal Trees

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. The evtree package implements an evolutionary algorithm for learning globally optimal classification and regression trees in R. CPU and memory-intensive tasks are fully computed in C++ while the partykit package is leveraged to represent the resulting trees in R, providing unified infrastructure for summaries, visualizations, and predictions.

Version: 1.0-0
Depends: R (≥ 2.11.0), partykit
Suggests: Formula, kernlab, lattice, mlbench, multcomp, party, rpart, xtable
Published: 2014-10-15
Author: Thomas Grubinger [aut, cre], Achim Zeileis [aut], Karl-Peter Pfeiffer [aut]
Maintainer: Thomas Grubinger <Thomas.Grubinger at scch.at>
License: GPL-2 | GPL-3
NeedsCompilation: yes
Citation: evtree citation info
Materials: NEWS
In views: MachineLearning
CRAN checks: evtree results


Reference manual: evtree.pdf
Vignettes: Evolutionary Learning of Globally Optimal Classification and Regression Trees in R
Package source: evtree_1.0-0.tar.gz
Windows binaries: r-devel: evtree_1.0-0.zip, r-release: evtree_1.0-0.zip, r-oldrel: evtree_1.0-0.zip
OS X Snow Leopard binaries: r-release: evtree_1.0-0.tgz, r-oldrel: evtree_1.0-0.tgz
OS X Mavericks binaries: r-release: evtree_1.0-0.tgz
Old sources: evtree archive

Reverse dependencies:

Reverse suggests: fscaret