Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning. A classification or regression decision tree serves as a predictive model that draws conclusions about a set of observations. Where the target variable takes a discrete set of values the model is a classification tree, whose leaves represent class labels and whose branches represent conjunctions of features leading to those labels. Where the target variable takes continuous values, typically real numbers, the model is a regression tree, and the idea extends to any kind of object equipped with pairwise dissimilarities, such as categorical sequences. Decision trees are among the most popular machine learning algorithms because they are intelligible and simple: the resulting models are easy to interpret and visualize, even for users without a statistical background.
Facts
Time Complexity
Time Complexity (category)Linearithmic Time -- O(n log n) 1 Connections
In Field
Source Decision tree learning - Wikipedia
Uses Design Technique
Source IBM: What is a decision tree?
Source IBM: What is a decision tree?
Sources
1. scikit-learn: scikit-learn: Decision Trees
scikit-learnComplexity sectionQuote, Complexity section
\(\mathcal{O}(n_{features}n_{samples}\log(n_{samples}))\)
View the Source Decision tree learning - Wikipedia
In Group: Decision Tree and Ensemble Learning Algorithms, Lead sentence
Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning.
In Field: Machine Learning, Lead sentence
Decision tree learning is a supervised learning approach used in statistics, data mining and machine learning.
View the SourceIBM: What is a decision tree?
IBMUses Design Technique: Divide and Conquer, Section on how decision tree learning works
Decision tree learning employs a divide and conquer strategy by conducting a greedy search to identify the optimal split points within a tree.
Uses Design Technique: Greedy Method, Section on how decision tree learning works
Decision tree learning employs a divide and conquer strategy by conducting a greedy search to identify the optimal split points within a tree.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.