[go: up one dir, main page]
Scribd
Upload
90 views13 pages

Decision Tree - IDS3

A decision tree is a supervised learning algorithm that uses a tree-like model to predict outcomes. It breaks down a dataset into smaller and smaller subsets while associating decisions with the results. The document discusses key decision tree concepts like internal nodes, branches, leaf nodes, and information gain. It also provides an example of how a decision tree works by finding the attribute with maximum information gain to use as the root node, then calculating the entropy of the dataset and each attribute. Decision trees are broken down recursively until pure leaf nodes are reached with target classifications.

Uploaded by

Zarfa Masood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
90 views13 pages

Decision Tree - IDS3

A decision tree is a supervised learning algorithm that uses a tree-like model to predict outcomes. It breaks down a dataset into smaller and smaller subsets while associating decisions with the results. The document discusses key decision tree concepts like internal nodes, branches, leaf nodes, and information gain. It also provides an example of how a decision tree works by finding the attribute with maximum information gain to use as the root node, then calculating the entropy of the dataset and each attribute. Decision trees are broken down recursively until pure leaf nodes are reached with target classifications.

Uploaded by

Zarfa Masood
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

11/10/2022

What is Decision Tree? (Supervised Learning)

It is a tree-structured classifier, where internal nodes represent the features of a dataset, branches

Decision Tree Classifier


represent the decision rules and each leaf node represents the label.

Dr. Muhammad Shoaib Farooq

Decision Tree (Problem Solving? Decision Tree (Problem Solving?


11/10/2022

Decision Tree (Problem Solving? Decision Tree (Important Terms)?

Decision Tree (Important Terms)? Decision Tree (Important Terms)?


11/10/2022

Decision Tree (Important Terms)? Decision Tree (Important Terms)?

Decision Tree (Important Terms)? How does a Decision Tree work?


11/10/2022

How does a Decision Tree work? How does a Decision Tree work?

How does a Decision Tree work? How does a Decision Tree work?
11/10/2022

How does a Decision Tree work? How does a Decision Tree work?

How does a Decision Tree work? How does a Decision Tree work?
11/10/2022

How does a Decision Tree work? How does a Decision Tree work?

How does a Decision Tree work? How does a Decision Tree work?
11/10/2022

How does a Decision Tree work? How does a Decision Tree work?

How does a Decision Tree work? How does a Decision Tree work?
11/10/2022
11/10/2022

Decision Tree
(Example)

Find the attribute with maximum


information gain.

Calculate information gain for each


attribute.
Attribute with max information gain will
be considered as root node of the tree.

For this, we need to calculate entropy for


entire data set as well as for each
attribute.
Entropy = - (+ve/total) log (+ve/total) – (-ve/total) log (-ve/total)
Entropy is measure of randomness or
disorder
0 means fully random, 1 means no
randomness
11/10/2022

14
11/10/2022
11/10/2022
11/10/2022

You might also like