Abstract
Decision tree induction is extremely popular in data mining, with most currently available techniques being refinements of Quinlan’s original work (Quinlan 1986). His divide-and-conquer approach to decision tree induction involves selecting an attribute to place at the root node and then make the same decision about every other node in the tree.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this chapter
Cite this chapter
Ferreira, C. (2006). Decision Tree Induction. In: Gene Expression Programming. Studies in Computational Intelligence, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32849-1_9
Download citation
DOI: https://doi.org/10.1007/3-540-32849-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32796-7
Online ISBN: 978-3-540-32849-0
eBook Packages: EngineeringEngineering (R0)