This article is about decision trees in decision analysis. For the use of the term in machine learning, see Decision tree learning.
Information mapping
Topics and fields
Business decision mapping
Data visualization
Graphic communication
Infographics
Information design
Knowledge visualization
Mental model
Morphological analysis
Ontology (information science)
Schema (psychology)
Visual analytics
Visual language
Node–link approaches
Argument map
Cladistics
Cognitive map
Concept lattice
Concept map
Conceptual graph
Decision tree
Dendrogram
Graph drawing
Hyperbolic tree
Hypertext
Issue map
Issue tree
Layered graph drawing
Mind map
Object-role modeling
Organizational chart
Pathfinder network
Radial tree
Semantic network
Sociogram
Timeline
Topic map
Tree structure
ZigZag
See also
Design rationale
Diagrammatic reasoning
Entity–relationship model
Geovisualization
List of concept- and mind-mapping software
Olog
Ontology (philosophy)
Problem structuring methods
Semantic Web
Treemapping
Wicked problem
v
t
e
A decision tree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility. It is one way to display an algorithm that only contains conditional control statements.
Decision trees are commonly used in operations research, specifically in decision analysis,[1] to help identify a strategy most likely to reach a goal, but are also a popular tool in machine learning.
^von Winterfeldt, Detlof; Edwards, Ward (1986). "Decision trees". Decision Analysis and Behavioral Research. Cambridge University Press. pp. 63–89. ISBN 0-521-27304-8.
A decisiontree is a decision support hierarchical model that uses a tree-like model of decisions and their possible consequences, including chance event...
Decisiontree learning is a supervised learning approach used in statistics, data mining and machine learning. In this formalism, a classification or...
learning and search algorithms that reduces the size of decisiontrees by removing sections of the tree that are non-critical and redundant to classify instances...
computational complexity the decisiontree model is the model of computation in which an algorithm is considered to be basically a decisiontree, i.e., a sequence...
typically simple decisiontrees. When a decisiontree is the weak learner, the resulting algorithm is called gradient-boosted trees; it usually outperforms...
tree size (total number of possible games), Decision complexity (number of leaf nodes in the smallest decisiontree 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...
or average prediction of the individual trees is returned. Random decision forests correct for decisiontrees' habit of overfitting to their training...
analysis, a decisiontree can be used to visually and explicitly represent decisions and decision making. In data mining, a decisiontree describes data...
A decision support system (DSS) is an information system that supports business or organizational decision-making activities. DSSs serve the management...
two types: Multi-relational decisiontree learning (MRDTL) uses a supervised algorithm that is similar to a decisiontree. Deep Feature Synthesis uses...
variance and helps to avoid overfitting. Although it is usually applied to decisiontree methods, it can be used with any type of method. Bagging is a special...
{\displaystyle f(0,1,1)} . The binary decisiontree of the left figure can be transformed into a binary decision diagram by maximally reducing it according...
(like random decisiontrees) can be used to produce a stronger ensemble than very deliberate algorithms (like entropy-reducing decisiontrees). Using a variety...
set of actions. The information expressed in decision tables could also be represented as decisiontrees or in a programming language as a series of if-then-else...
example, the engineer may choose to use support-vector machines or decisiontrees. Complete the design. Run the learning algorithm on the gathered training...
In decisiontree learning, ID3 (Iterative Dichotomiser 3) is an algorithm invented by Ross Quinlan used to generate a decisiontree from a dataset. ID3...
science) Trees can also be represented radially: Kinds of trees B-tree Dancing treeDecisiontree Left-child right-sibling binary tree Porphyrian treeTree (data...
A decision model in decision theory is the starting point for a decision method within a formal (axiomatic) system. Decision models contain at least one...
machine learning, originally developed by Microsoft. It is based on decisiontree algorithms and used for ranking, classification and other machine learning...
deterministic decisiontrees, and for any k in the range 2 ≤ k ≤ n, the property of containing a k-clique was shown to have decisiontree complexity exactly...