Jump to content

ID3 algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Fijal (talk | contribs) at 08:21, 31 May 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

ID3 is algorithm used to generate Decision tree.

Main idea is based on Okcham's razor - world is as simple as it should be. To count exactly 'as simple as possible' we count Entropy, described as follows:

Tree making is described as follows:

  • Take all unused attributes and count their entropy concerning test samples
  • Choose attribute which entropy is smallest
  • Make node containing that attribute