Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Decision tree

Known as: Probability tree, Decision graph, Decision-tree 
A decision tree is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Gradient Boosting Decision Tree (GBDT) is a popular machine learning algorithm, and has quite a few effective implementations… Expand
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The technology for building knowledge-based systems by inductive inference from examples has been demonstrated successfully in… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Bagging and boosting are methods that generate a diverse ensemble of classifiers by manipulating the training data given to a… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Although topddown induction of decision trees is a very popular induction method, up till now it has mainly been used for… Expand
  • figure 2.5
  • figure 4.6
  • figure 6.9
  • figure 7.5
  • figure 7.6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Naive-Bayes induction algorithms were previously shown to be surprisingly accurate on many classification tasks even when the… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper, a new probabilistic tagging method is presented which avoids problems that Markov Model based taggers face, when… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill… Expand
  • figure 5
  • table 1
  • figure 9
  • table 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
  • P. Utgoff
  • Machine Learning
  • 1989
  • Corpus ID: 5293072
This article presents an incremental algorithm for inducing decision trees equivalent to those formed by Quinlan's nonincremental… Expand
  • table 5
  • table 6
  • table 7
  • table 8
  • table 9
Is this relevant?
Highly Cited
1976
Highly Cited
1976
We demonstrate that cons&g optimal binary de&ion trees ia an NP=compkt.e probtem, where an op timal tree is one which minin&s the… Expand
Is this relevant?