Swipe to navigate through the chapters of this book
This chapter introduces the TDIDT (Top-Down Induction of Decision Trees) algorithm for inducing classification rules via the intermediate representation of a decision tree. The algorithm can always be applied provided the ‘adequacy condition’ holds for the instances in the training set. The chapter ends by distinguishing three types of reasoning: deduction, abduction and induction.
Please log in to get access to this content
To get access to this content you need the following product:
Michie, D. (1990). Machine executable skills from ‘silent’ brains. In Research and development in expert systems VII. Cambridge: Cambridge University Press.
Quinlan, J. R. (1993). C4.5: programs for machine learning. San Mateo: Morgan Kaufmann.
Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1, 81–106.
- Using Decision Trees for Classification
Prof. Max Bramer
- Springer London
- Sequence number
- Chapter number