Decision Tree
Decision Tree
Decision Tree
• It is a supervised learning method used for
both classification and regression tasks.
• A decision tree is a tree in which each branch
node represents a choice between number of
alternatives and each leaf node represents a
decision.
• The decision tree does a great job of distilling
data into knowledge
• Works with: Numeric values, nominal values
General approach to decision trees
1 Collect: Any method.
2. Prepare: This tree-building algorithm works only on
nominal values, so any continuous values will need to
be quantized.
3. Analyze: Any method. You should visually inspect the
tree after it is built.
4. Train: Construct a tree data structure.
5. Test: Calculate the error rate with the learned tree.
6. Use: This can be used in any supervised learning task.
Often, trees are used to better understand the data.
By using information theory, you can measure the information before
and after the split.
The change in information before and after the split is known as
the information gain.
Information gain