Decision Tree Learning using ID3 Algorithm | Artificial intelligence | Machine Learning
#askfaizan | #syedfaizanahmad | #decisiontree
PlayList : Artificial Intelligence : • Artificial Intelligence
Bayesian Network in Artificial Intelligence | Bayesian Belief Network | • Bayesian Network in Artificial Intelligenc...
Decision Tree Learning using ID3 Algorithm | Artificial intelligence • Decision Tree Learning using ID3 Algorithm...
Supervised Learning and Unsupervised Learning | Learning in Artificial Intelligence • Supervised Learning and Unsupervised Learn...
Genetic Algorithm | Artificial Intelligence Tutorial in Hindi Urdu • Genetic Algorithm | Artificial Intelligenc...
Comparison of Search Algorithm • Comparison of Search Algorithm | Complexit...
Resolution in Artificial Intelligence | Resolution Rules in AI • Resolution in Artificial Intelligence | Re...
Inference rules in Predicate logic • Inference rules in Predicate logic| FOL in...
Predicate logic in AI | First order logic in Artificial Intelligence • Predicate logic in AI | First order logic ...
Wumpus World Proving | Propositional logic Example • Wumpus World Proving | Propositional logic...
PROPOSITIONAL LOGIC | Artificial Intelligence • PROPOSITIONAL LOGIC | Artificial Intellige...
Knowledge based Agents | Logical agents • Knowledge based Agents | Logical agents | ...
Alpha Beta Pruning | Problem #2 • Alpha Beta Pruning | Problem #2 | Alpha-Be...
A Decision tree represents a function that takes as input a vector of attribute values and returns a “decision”—a single output value.
The input and output values can be discrete or continuous.
A decision tree reaches its decision by performing a sequence of tests.
There are many specific decision-tree algorithms. Notable ones include:
ID3 (Iterative Dichotomiser 3)
C4.5 (successor of ID3)
CART (Classification And Regression Tree)
CHAID (Chi-squared Automatic Interaction Detector). Performs multi-level splits when computing classification trees.
MARS: extends decision trees to handle numerical data better.
ID3 is one of the most common decision tree algorithm
Dichotomisation means dividing into two completely opposite things.
Algorithm iteratively divides attributes into two groups which are the most dominant attribute and others to construct a tree.
Then, it calculates the Entropy and Information Gains of each attribute. In this way, the most dominant attribute can be founded.
After then, the most dominant one is put on the tree as decision node.
Entropy and Gain scores would be calculated again among the other attributes.
Procedure continues until reaching a decision for that branch.
algorithm steps:
Calculate the entropy of every attribute using the data set S
Entropy(S) = ∑ – p(I) . log2p(I)
Split the set S into subsets using the attribute for which the resulting entropy (after splitting) is minimum (or, equivalently, information gain is maximum)
Gain(S, A) = Entropy(S) – ∑ [ p(S|A) . Entropy(S|A) ]
Make a decision tree node containing that attribute
Recurse on subsets using remaining attributes.
for Complete Artificial Intelligence Videos click on the link :
• Artificial Intelligence
Thank you for watching
share with your friends
Follow on :
Facebook page : / askfaizan1
Instagram page : / ask_faizan
Twitter : / ask_faizan