About

ID3 algorithm: Attributes are discrete and the continuous attributes are discretized.

It produces a decision tree

Articles Related

Algo

while (All examples assigned the same label or No examples left) then
  * Choose the remaining attribute with the highest Information Gain 
  * Create branches of the tree for each value of the attribute
  * Suppress the attribute from the list

where:

• Information Gain