Skip to Content
Practical Applications of Data Mining
book

Practical Applications of Data Mining

by Sang C. Suh
January 2011
Intermediate to advanced
420 pages
12h 32m
English
Jones & Bartlett Learning
Content preview from Practical Applications of Data Mining
128 Chapter 3 ClassifiCation learning
Now, the node 8. astigmatism becomes the lowest-level internal node. Its
right branch is still not a leaf node and needs to be expanded.
The branch 9. astigmatism is yes is split into two branches hypermetropic and
myopic by the attribute prescription. The branch hypermetropic leads to the
attribute age and splits into three leaf nodes.
The expanding procedure stops at this point and the post-pruning starts 10.
again toward the root of the partial tree.
No internal node is replaced in this round of post-pruning. The final 11.
partial tree is shown in Figure 3.10.
Six rules are generated from the partial ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Data Mining

Data Mining

Nong Ye
Data Mining and Machine Learning Applications

Data Mining and Machine Learning Applications

Rohit Raja, Kapil Kumar Nagwanshi, Sandeep Kumar, K. Ramya Laxmi
R Data Mining

R Data Mining

Enrico Pegoraro, Andrea Cirillo

Publisher Resources

ISBN: 9780763785871