Experiment-3:

Write a program to demonstrate the working of the decision tree based ID3

algorithm. Use an appropriate data set for building the decision tree and apply this

knowledge to classify a new sample.

 Decision trees are one of the simplest non-linear supervised algorithms in the machine

learning world.

 As the name suggests they are used for making decisions in ML terms we call it

classification (although they can be used for regression as well).

 The decision trees have a unidirectional tree structure i.e. at every node the algorithm

makes a decision to split into child nodes based on certain stopping criteria. Most

commonly DTs use entropy, information gain, Gini index, etc.

CODING

1
2
3