A decision tree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event...

Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning. In this formalism, a classification or...

computational complexity the decision tree model is the model of computation in which an algorithm is considered to be basically a decision tree, i.e., a sequence...

learning and search algorithms that reduces the size of decision trees by removing sections of the tree that are non-critical and redundant to classify instances...

typically simple decision trees. When a decision tree is the weak learner, the resulting algorithm is called gradient-boosted trees; it usually outperforms...

An incremental decision tree algorithm is an online machine learning algorithm that outputs a decision tree. Many decision tree methods, such as C4.5,...

from observing another random variable. However, in the context of decision trees, the term is sometimes used synonymously with mutual information, which...

An alternating decision tree (ADTree) is a machine learning method for classification. It generalizes decision trees and has connections to boosting....

tree size (total number of possible games), Decision complexity (number of leaf nodes in the smallest decision tree for initial position), Game-tree complexity...

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all...