Presentation is loading. Please wait.

Presentation is loading. Please wait.

Artificial Intelligence 11. Decision Tree Learning Course V231 Department of Computing Imperial College, London © Simon Colton.

Similar presentations

Presentation on theme: "Artificial Intelligence 11. Decision Tree Learning Course V231 Department of Computing Imperial College, London © Simon Colton."— Presentation transcript:

1 Artificial Intelligence 11. Decision Tree Learning Course V231 Department of Computing Imperial College, London © Simon Colton

2 What to do this Weekend? If my parents are visiting – Well go to the cinema If not – Then, if its sunny Ill play tennis – But if its windy and Im rich, Ill go shopping – If its windy and Im poor, Ill go to the cinema – If its rainy, Ill stay in

3 Written as a Decision Tree Root of tree Leaves

4 Using the Decision Tree (No parents on a Sunny Day)

5 From Decision Trees to Logic Decision trees can be written as – Horn clauses in first order logic Read from the root to every tip – If this and this and this … and this, then do this In our example: – If no_parents and sunny_day, then play_tennis – no_parents sunny_day play_tennis

6 Decision Tree Learning Overview Decision tree can be seen as rules for performing a categorisation – E.g., what kind of weekend will this be? Remember that were learning from examples – Not turning thought processes into decision trees We need examples put into categories We also need attributes for the examples – Attributes describe examples (background knowledge) – Each attribute takes only a finite set of values

7 The ID3 Algorithm - Overview The major question in decision tree learning – Which nodes to put in which positions – Including the root node and the leaf nodes ID3 uses a measure called Information Gain – Based on a notion of entropy Impurity in the data – Used to choose which node to put in next Node with the highest information gain is chosen – When there are no choices, a leaf node is put on

8 Entropy – General Idea From Tom Mitchells book: – In order to define information gain precisely, we begin by defining a measure commonly used in information theory, called entropy that characterizes the (im)purity of an arbitrary collection of examples Want a notion of impurity in data Imagine a set of boxes and balls in them If all balls are in one box – This is nicely ordered – so scores low for entropy Calculate entropy by summing over all boxes – Boxes with very few in scores low – Boxes with almost all examples in scores low

9 Entropy - Formulae Given a set of examples, S For examples in a binary categorisation – Where p + is the proportion of positives – And p - is the proportion of negatives For examples in categorisations c 1 to c n – Where p n is the proportion of examples in c n

10 Entropy - Explanation Each category adds to the whole measure When p i is near to 1 – (Nearly) all the examples are in this category So it should score low for its bit of the entropy – log 2 (p i ) gets closer and closer to 0 And this part dominates the overall calculation So the overall calculation comes to nearly 0 (which is good) When p i is near to 0 – (Very) few examples are in this category So it should score low for its bit of the entropy – log 2 (p i ) gets larger (more negative), but does not dominate – Hence overall calculation comes to nearly 0 (which is good)

11 Information Gain Given set of examples S and an attribute A – A can take values v 1 … v m – Let S v = {examples which take value v for attribute A} Calculate Gain(S,A) – Estimates the reduction in entropy we get if we know the value of attribute A for the examples in S

12 An Example Calculation of Information Gain Suppose we have a set of examples – S = {s 1, s 2, s 3, s 4 } – In a binary categorisation With one positive example and three negative examples The positive example is s 1 And Attribute A – Which takes values v 1, v 2, v 3 S 1 takes value v 2 for A, S 2 takes value v 2 for A S 3 takes value v 3 for A, S 4 takes value v 1 for A

13 First Calculate Entropy(S) Recall that Entropy(S) = -p + log 2 (p + ) – p - log 2 (p - ) From binary categorisation, we know that p + = ¼ and p - = ¾ Hence Entropy(S) = -(1/4)log 2 (1/4) – (3/4)log 2 (3/4) = Note for users of old calculators: – May need to use the fact that log 2 (x) = ln(x)/ln(2) And also note that, by convention: 0*log 2 (0) is taken to be 0

14 Calculate Gain for each Value of A Remember that And that S v = {set of example with value V for A} – So, S v1 = {s 4 }, S v2 = {s 1,s 2 }, S v3 ={s 3 } Now, (|S v1 |/|S|) * Entropy(S v1 ) = (1/4) * (-(0/1)*log 2 (0/1)-(1/1)log 2 (1/1)) = (1/4) * (0 - (1)log 2 (1)) = (1/4)(0-0) = 0 Similarly, (|S v2 |/|S|) = 0.5 and (|S v3 |/|S|) = 0

15 Final Calculation So, we add up the three calculations and take them from the overall entropy of S: Final answer for information gain: – Gain(S,A) = – (0+1/2+0) = 0.311

16 The ID3 Algorithm Given a set of examples, S – Described by a set of attributes A i – Categorised into categories c j 1. Choose the root node to be attribute A – Such that A scores highest for information gain Relative to S, i.e., gain(S,A) is the highest over all attributes 2. For each value v that A can take – Draw a branch and label each with corresponding v Then see the options in the next slide!

17 The ID3 Algorithm For each branch youve just drawn (for value v) – If S v only contains examples in category c Then put that category as a leaf node in the tree – If S v is empty Then find the default category (which contains the most examples from S) – Put this default category as a leaf node in the tree – Otherwise Remove A from attributes which can be put into nodes Replace S with S v Find new attribute A scoring best for Gain(S, A) Start again at part 2 Make sure you replace S with S v

18 Explanatory Diagram

19 A Worked Example WeekendWeatherParentsMoneyDecision (Category) W1SunnyYesRichCinema W2SunnyNoRichTennis W3WindyYesRichCinema W4RainyYesPoorCinema W5RainyNoRichStay in W6RainyYesPoorCinema W7WindyNoPoorCinema W8WindyNoRichShopping W9WindyYesRichCinema W10SunnyNoRichTennis

20 Information Gain for All of S S = {W1,W2,…,W10} Firstly, we need to calculate: – Entropy(S) = … = (see notes) Next, we need to calculate information gain – For all the attributes we currently have available (which is all of them at the moment) – Gain(S, weather) = … = 0.7 – Gain(S, parents) = … = 0.61 – Gain(S, money) = … = Hence, the weather is the first attribute to split on – Because this gives us the biggest information gain

21 Top of the Tree So, this is the top of our tree: Now, we look at each branch in turn – In particular, we look at the examples with the attribute prescribed by the branch S sunny = {W1,W2,W10} – Categorisations are cinema, tennis and tennis for W1,W2 and W10 – What does the algorithm say? Set is neither empty, nor a single category So we have to replace S by S sunny and start again

22 Working with S sunny Need to choose a new attribute to split on – Cannot be weather, of course – weve already had that So, calculate information gain again: – Gain(S sunny, parents) = … = – Gain(S sunny, money) = … = 0 Hence we choose to split on parents WeekendWeatherParentsMoneyDecision W1SunnyYesRichCinema W2SunnyNoRichTennis W10SunnyNoRichTennis

23 Getting to the leaf nodes If its sunny and the parents have turned up – Then, looking at the table in previous slide Theres only one answer: go to cinema If its sunny and the parents havent turned up – Then, again, theres only one answer: play tennis Hence our decision tree looks like this:

24 Avoiding Overfitting Decision trees can be learned to perfectly fit the data given – This is probably overfitting The answer is a memorisation, rather than generalisation Avoidance method 1: – Stop growing the tree before it reaches perfection Avoidance method 2: – Grow to perfection, then prune it back aftwerwards Most useful of two methods in practice

25 Appropriate Problems for Decision Tree learning From Tom Mitchells book: – Background concepts describe examples in terms of attribute-value pairs, values are always finite in number – Concept to be learned (target function) Has discrete values – Disjunctive descriptions might be required in the answer Decision tree algorithms are fairly robust to errors – In the actual classifications – In the attribute-value pairs – In missing information

Download ppt "Artificial Intelligence 11. Decision Tree Learning Course V231 Department of Computing Imperial College, London © Simon Colton."

Similar presentations

Ads by Google