Fetching the paper…
Reading the bibliography…
Decision trees algorithms use a gain function to select the best split during the tree's induction.
Applications of information theory to psychology
Attneave, F · 1959
Earlier work this paper cites.
A recursive partitioning decision rule for nonparametric classifiers
Friedman, J. H · 1977
Earlier work this paper cites.
Classification and regression trees
Breiman, L., Friedman, J., Stone, C. J., and Olshen, R. A · 1984
Earlier work this paper cites.
Induction of decision trees
Quinlan, J. R · 1986
Earlier work this paper cites.
Computational Complexity of Machine Learning
Kearns, M. J · 1989
Earlier work this paper cites.
A distance-based attribute selection measure for decision tree induction
LopezDeMantras, R · 1991
Cited alongside, same era.
The attribute selection problem in decision tree generation
Fayyad, U. and Irani, K. B · 1992
Cited alongside, same era.
The oc1 decision tree software system
Murthy, S. K., Kasif, S., and Salzberg, S · 1993
Cited alongside, same era.
Oversearching and layered search in empirical learning
Quinlan, J.R. and Cameron-Jones, R.M · 1995
Cited alongside, same era.
Learning decision trees using the area under the roc curve
Ferri, C., Flach, P., and Hernandez-Orallo, J · 2002
Later among the works it cites.
Building multi-way decision trees with numerical attributes
Berzal, Fernando, Cubero, Juan-Carlos, Marín, Nicolás, and Sánchez, Daniel · 2004
Later among the works it cites.
Data mining with decision trees: Theory and applications
Rokach, L · 2008
Later among the works it cites.
UCI machine learning repository, 2013
Lichman, M · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…