Jump to content

Decision tree learning

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Raand (talk | contribs) at 03:20, 5 April 2004. 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)

A type of method commonly used in data mining. A decision tree describes a tree wherein leaves describe classifications and branches describe conjunctions of features that lead to those classifications [1].

External Sources

[1] T. Menzies and Y. Hu. Data Mining For Busy People. IEEE Computer, October 2003, pgs. 18-25.