Classification with Decision Trees. Instructor: Qiang Yang Hong Kong University of Science and Technology Qyang@cs.ust.hk Thanks: Eibe Frank and Jiawei Han. DECISION TREE [Quinlan93]. An internal node represents a test on an attribute.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Classification with Decision Trees
Instructor: Qiang Yang
Hong Kong University of Science and Technology
Thanks: Eibe Frank and Jiawei Han
Note: this is
Splitting stops when data can’t be split any further
where pj is the relative frequency of class j in T. gini(T) is minimized if the classes in T are skewed.
25% confidence interval
If we have a
single leaf node
If we split, we can
this gives 0.51