Scribd
Upload
20 views1 page

ID3 Algorithm For Decision Trees ID3 (Examples, Target - Attribute, Attributes)

The ID3 algorithm builds decision trees by selecting the attribute that is most useful for classifying examples at each step, starting with the root node. It recursively splits the examples into branches for each possible value of the selected attribute, calling itself on the examples in each branch with one less attribute, until the examples are all of the same class or there are no more attributes left to split on. The leaf nodes are then labeled with the most common class of the examples in that branch.

Uploaded by

d-fbuser-67397616
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
20 views1 page

ID3 Algorithm For Decision Trees ID3 (Examples, Target - Attribute, Attributes)

The ID3 algorithm builds decision trees by selecting the attribute that is most useful for classifying examples at each step, starting with the root node. It recursively splits the examples into branches for each possible value of the selected attribute, calling itself on the examples in each branch with one less attribute, until the examples are all of the same class or there are no more attributes left to split on. The leaf nodes are then labeled with the most common class of the examples in that branch.

Uploaded by

d-fbuser-67397616
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

ID3 Algorithm for Decision Trees

ID3 (Examples, Target_Attribute, Attributes)

- Create a root node for the tree


- IF all examples are positive, Return the single-node tree Root, with label = +
- If all examples are negative, Return the single-node tree Root, with label = -
- If number of predicting attributes is empty, then Return the single node tree Root, with label =
most common value of the target attribute in the examples
- Otherwise Begin
o A  The Attribute that best classifies examples
o Decision Tree attribute for Root  A
o For each positive value, vi, of A,
 Add a new tree branch below Root, corresponding to the test A = vi
 Let Examples(vi), be the subset of examples that have the value vi for A
 If Examples(vi) is empty
 Then below this new branch add a leaf node with label = most common
target value in the examples
 Else below this new branch add the subtree
ID3 (Examples(vi), Target_Attribute, Attributes – {A})
- End
- Return Root

You might also like