Classification with Decision Trees I

1. Classification with Decision Trees I Instructor: Qiang Yang Hong Kong University of Science and Technology Qyang@cs.ust.hk Thanks: Eibe Frank and Jiawei Han

2. INTRODUCTION • Given a set of pre-classified examples, build a model or classifier to classify new cases. • Supervised learning in that classes are known for the examples used to build the classifier. • A classifier can be a set of rules, a decision tree, a neural network, etc. • Typical Applications: credit approval, target marketing, fraud detection, medical diagnosis, treatment effectiveness analysis, …..

3. Constructing a Classifier • The goal is to maximize the accuracy on new cases that have similar class distribution. • Since new cases are not available at the time of construction, the given examples are divided into the testing set and the training set. The classifier is built using the training set and is evaluated using the testing set. • The goal is to be accurate on the testing set. It is essential to capture the “structure” shared by both sets. • Must prune overfitting rules that work well on the training set, but poorly on the testing set.

4. Training Data Classifier (Model) Example Classification Algorithms IF rank = ‘professor’ OR years > 6 THEN tenured = ‘yes’

5. Classifier Testing Data Unseen Data Example (Conted) (Jeff, Professor, 4) Tenured?

6. Evaluation Criteria • Accuracy on test set • the rate of correct classification on the testing set. E.g., if 90 are classified correctly out of the 100 testing cases, accuracy is 90%. • Error Rate on test set • The percentage of wrong predictions on test set • Confusion Matrix • For binary class values, “yes” and “no”, a matrix showing true positive, true negative, false positive and false negative rates • Speed and scalability • the time to build the classifier and to classify new cases, and the scalability with respect to the data size. • Robustness: handling noise and missing values

7. Evaluation Techniques • Holdout: the training set/testing set. • Good for a large set of data. • k-fold Cross-validation: • divide the data set into k sub-samples. • In each run, use one distinct sub-sample as testing set and the remaining k-1 sub-samples as training set. • Evaluate the method using the average of the k runs. • This method reduces the randomness of training set/testing set.

8. Cross Validation: Holdout Method • Break up data into groups of the same size • Hold aside one group for testing and use the rest to build model • Repeat iteration Test 8

9. Continuous Classes • Sometimes, classes are continuous in that they come from a continuous domain, • e.g., temperature or stock price. • Regression is well suited in this case: • Linear and multiple regression • Non-Linear regression • We shall focus on categorical classes, e.g., colors or Yes/No binary decisions. • We will deal with continuous class values later in CART

10. DECISION TREE [Quinlan93] • An internal node represents a test on an attribute. • A branch represents an outcome of the test, e.g., Color=red. • A leaf node represents a class label or class label distribution. • At each node, one attribute is chosen to split training examples into distinct classes as much as possible • A new case is classified by following a matching path to a leaf node.

11. Training Set

12. Example Outlook sunny overcast rain overcast humidity windy P high normal false true N P N P

13. Building Decision Tree [Q93] • Top-down tree construction • At start, all training examples are at the root. • Partition the examples recursively by choosing one attribute each time. • Bottom-up tree pruning • Remove subtrees or branches, in a bottom-up manner, to improve the estimated accuracy on new cases.

14. Choosing the Splitting Attribute • At each node, available attributes are evaluated on the basis of separating the classes of the training examples. A Goodness function is used for this purpose. • Typical goodness functions: • information gain (ID3/C4.5) • information gain ratio • gini index

15. Which attribute to select?

16. A criterion for attribute selection • Which is the best attribute? • The one which will result in the smallest tree • Heuristic: choose the attribute that produces the “purest” nodes • Popular impurity criterion: information gain • Information gain increases with the average purity of the subsets that an attribute produces • Strategy: choose attribute that results in greatest information gain

17. Computing information • Information is measured in bits • Given a probability distribution, the info required to predict an event is the distribution’s entropy • Entropy gives the information required in bits (this can involve fractions of bits!) • Formula for computing the entropy:

18. Example: attribute “Outlook” • “Outlook” = “Sunny”: • “Outlook” = “Overcast”: • “Outlook” = “Rainy”: • Expected information for attribute: Note: this is normally not defined.

19. Computing the information gain • Information gain: information before splitting – information after splitting • Information gain for attributes from weather data:

20. Continuing to split

21. The final decision tree • Note: not all leaves need to be pure; sometimes identical instances have different classes  Splitting stops when data can’t be split any further

22. Highly-branching attributes • Problematic: attributes with a large number of values (extreme case: ID code) • Subsets are more likely to be pure if there is a large number of values • Information gain is biased towards choosing attributes with a large number of values • This may result in overfitting (selection of an attribute that is non-optimal for prediction) • Another problem: fragmentation

23. The gain ratio • Gain ratio: a modification of the information gain that reduces its bias on high-branch attributes • Gain ratio takes number and size of branches into account when choosing an attribute • It corrects the information gain by taking the intrinsic information of a split into account • Also called split ratio • Intrinsic information: entropy of distribution of instances into branches • (i.e. how much info do we need to tell which branch an instance belongs to)

24. Gain Ratio • Gain ratio should be • Large when data is evenly spread • Small when all data belong to one branch • Gain ratio (Quinlan’86) normalizes info gain by this reduction:

25. Computing the gain ratio • Example: intrinsic information for ID code • Importance of attribute decreases as intrinsic information gets larger • Example of gain ratio: • Example:

26. Gain ratios for weather data

27. More on the gain ratio • “Outlook” still comes out top • However: “ID code” has greater gain ratio • Standard fix: ad hoc test to prevent splitting on that type of attribute • Problem with gain ratio: it may overcompensate • May choose an attribute just because its intrinsic information is very low • Standard fix: • First, only consider attributes with greater than average information gain • Then, compare them on gain ratio

28. Gini Index • If a data set T contains examples from n classes, gini index, gini(T) is defined as where pj is the relative frequency of class j in T. gini(T) is minimized if the classes in T are skewed. • After splitting T into two subsets T1 and T2 with sizes N1 and N2, the gini index of the split data is defined as • The attribute providing smallest ginisplit(T) is chosen to split the node.

29. Discussion • Algorithm for top-down induction of decision trees (“ID3”) was developed by Ross Quinlan • Gain ratio just one modification of this basic algorithm • Led to development of C4.5, which can deal with numeric attributes, missing values, and noisy data • Similar approach: CART (linear regression tree, WF book, Chapter 6.5) • There are many other attribute selection criteria! (But almost no difference in accuracy of result.)