machine learning 3 - decision tree learning

29
Machine Learning Chapter 3. Decision Tree Learning Tom M. Mitchell

Upload: butest

Post on 20-Nov-2014

2.047 views

Category:

Documents


0 download

DESCRIPTION

 

TRANSCRIPT

Page 1: Machine Learning 3 - Decision Tree Learning

Machine Learning

Chapter 3. Decision Tree Learning

Tom M. Mitchell

Page 2: Machine Learning 3 - Decision Tree Learning

2

Abstract

Decision tree representation ID3 learning algorithm Entropy, Information gain Overfitting

Page 3: Machine Learning 3 - Decision Tree Learning

3

Decision Tree for PlayTennis

Page 4: Machine Learning 3 - Decision Tree Learning

4

A Tree to Predict C-Section Risk Learned from medical records of 1000 women Negative examples are C-sections

Page 5: Machine Learning 3 - Decision Tree Learning

5

Decision Trees

Decision tree representation:– Each internal node tests an attribute– Each branch corresponds to attribute value– Each leaf node assigns a classification

How would we represent: , , XOR– (A B) (C D E)– M of N

Page 6: Machine Learning 3 - Decision Tree Learning

6

When to Consider Decision Trees

Instances describable by attribute-value pairs Target function is discrete valued Disjunctive hypothesis may be required Possibly noisy training data

Examples: Equipment or medical diagnosis Credit risk analysis Modeling calendar scheduling preferences

Page 7: Machine Learning 3 - Decision Tree Learning

7

Top-Down Induction of Decision Trees

Main loop:1. A the “best” decision attribute for next node2. Assign A as decision attribute for node3. For each value of A, create new descendant of node4. Sort training examples to leaf nodes5. If training examples perfectly classified, Then STOP, Else iterate over new

leaf nodes Which attribute is best?

Page 8: Machine Learning 3 - Decision Tree Learning

8

Entropy(1/2)

S is a sample of training examples p⊕ is the proportion of positive examples in S p⊖ is the proportion of negative examples in S Entropy measures the impurity of S

Entropy(S) - p⊕log2 p⊕ - p⊖log2 p⊖

Page 9: Machine Learning 3 - Decision Tree Learning

9

Entropy(2/2)

Entropy(S) = expected number of bits needed to encode class ( or ) of randomly drawn member of S (under the ⊕ ⊖optimal, shortest-length code)

Why?Information theory: optimal length code assigns

– log2p bits to message having probability p.

So, expected number of bits to encode or of random ⊕ ⊖member of S:

p⊕(-log2 p⊕) + p⊖(-log2 p⊖)

Entropy(S) - p⊕log2 p⊕ - p⊖log2 p⊖

Page 10: Machine Learning 3 - Decision Tree Learning

10

Information Gain

Gain(S, A) = expected reduction in entropy due to sorting on A

Page 11: Machine Learning 3 - Decision Tree Learning

11

Training Examples

Page 12: Machine Learning 3 - Decision Tree Learning

12

Selecting the Next Attribute(1/2)

Which attribute is the best classifier?

Page 13: Machine Learning 3 - Decision Tree Learning

13

Selecting the Next Attribute(2/2)

Ssunny = {D1,D2,D8,D9,D11}Gain (Ssunny , Humidity) = .970 - (3/5) 0.0 - (2/5) 0.0 = .970Gain (Ssunny , Temperature) = .970 - (2/5) 0.0 - (2/5) 1.0 - (1/5) 0.0 = .570Gain (Ssunny, Wind) = .970 - (2/5) 1.0 - (3/5) .918 = .019

Page 14: Machine Learning 3 - Decision Tree Learning

14

Hypothesis Space Search by ID3(1/2)

Page 15: Machine Learning 3 - Decision Tree Learning

15

Hypothesis Space Search by ID3(2/2)

Hypothesis space is complete!– Target function surely in there...

Outputs a single hypothesis (which one?)– Can’t play 20 questions...

No back tracking– Local minima...

Statistically-based search choices– Robust to noisy data...

Inductive bias: approx “prefer shortest tree”

Page 16: Machine Learning 3 - Decision Tree Learning

16

Inductive Bias in ID3

Note H is the power set of instances X→ Unbiased?Not really... Preference for short trees, and for those with high i

nformation gain attributes near the root Bias is a preference for some hypotheses, rather th

an a restriction of hypothesis space H Occam's razor: prefer the shortest hypothesis that f

its the data

Page 17: Machine Learning 3 - Decision Tree Learning

17

Occam’s RazorWhy prefer short hypotheses?Argument in favor : Fewer short hyps. than long hyps.

→ a short hyp that fits data unlikely to be coincidence→ a long hyp that fits data might be coincidence

Argument opposed : There are many ways to define small sets of hyps e.g., all trees with a prime number of nodes that use attribute

s beginning with “Z” What's so special about small sets based on size of hypothesi

s??

Page 18: Machine Learning 3 - Decision Tree Learning

18

Overfitting in Decision Trees

Consider adding noisy training example #15:Sunny, Hot, Normal, Strong, PlayTennis = NoWhat effect on earlier tree?

Page 19: Machine Learning 3 - Decision Tree Learning

19

Overfitting

Consider error of hypothesis h over training data: errortrain(h) entire distribution D of data: errorD(h)Hypothesis h ∈ H overfits training data if there is an

alternative hypothesis h'∈ H such thaterrortrain(h) < errortrain(h')

anderrorD(h) > errorD(h')

Page 20: Machine Learning 3 - Decision Tree Learning

20

Overfitting in Decision Tree Learning

Page 21: Machine Learning 3 - Decision Tree Learning

21

Avoiding Overfitting

How can we avoid overfitting? stop growing when data split not statistically significant grow full tree, then post-prune

How to select “best” tree : Measure performance over training data Measure performance over separate validation data set MDL: minimize

size(tree) + size(misclassifications(tree))

Page 22: Machine Learning 3 - Decision Tree Learning

22

Reduced-Error Pruning

Split data into training and validation setDo until further pruning is harmful:1. Evaluate impact on validation set of pruning each

possible node (plus those below it)2. Greedily remove the one that most improves valid

ation set accuracy produces smallest version of most accurate subtree What if data is limited?

Page 23: Machine Learning 3 - Decision Tree Learning

23

Effect of Reduced-Error Pruning

Page 24: Machine Learning 3 - Decision Tree Learning

24

Rule Post-Pruning

1. Convert tree to equivalent set of rules2. Prune each rule independently of others3. Sort final rules into desired sequence for use

Perhaps most frequently used method (e.g., C4.5 )

Page 25: Machine Learning 3 - Decision Tree Learning

25

Converting A Tree to Rules

IF (Outlook = Sunny) (∧ Humidity = High)THEN PlayTennis = NoIF (Outlook = Sunny) (∧ Humidity = Normal)THEN PlayTennis = Yes ….

Page 26: Machine Learning 3 - Decision Tree Learning

26

Continuous Valued Attributes

Create a discrete attribute to test continuous Temperature = 82.5 (Temperature > 72.3) = t, f

Page 27: Machine Learning 3 - Decision Tree Learning

27

Attributes with Many ValuesProblem: If attribute has many values, Gain will select it Imagine using Date = Jun_3_1996 as attribute

One approach : use GainRatio instead

where Si is subset of S for which A has value vi

SS

SS

ASmationSplitInfor

ASmationSplitInforASGainASGainRatio

ic

i

i

12log),(

),(),(),(

Page 28: Machine Learning 3 - Decision Tree Learning

28

Attributes with CostsConsider medical diagnosis, BloodTest has cost $150 robotics, Width_from_1ft has cost 23 sec.How to learn a consistent tree with low expected cost?One approach: replace gain by

Tan and Schlimmer (1990)

Nunez (1988)

where w [0,1] determines importance of cost∈

)(),(2

ACostASGain

w

ASGain

ACost )1)((12 ),(

Page 29: Machine Learning 3 - Decision Tree Learning

29

Unknown Attribute Values

What if some examples missing values of A?Use training example anyway, sort through tree If node n tests A, assign most common value of A among

other examples sorted to node n assign most common value of A among other examples

with same target value assign probability pi to each possible value vi of A

– assign fraction pi of example to each descendant in tree

Classify new examples in same fashion