Python Machine Learning Decision Tree

Dark code
  HTML CSS JAVASCRIPT   

 Menu  Log in
Machine Learning - Decision Tree

❮ Previous Next ❯
Dark mode
D k d
Dark code
Decision Tree
In this chapter we will show you how to make a "Decision Tree". A Decision Tree is a Flow
Chart, and can help you make decisions based on previous experience.
In the example, a person will try to decide if he/she should go to a comedy show or not.
Luckily our example person has registered every time there was a comedy show in town,
and registered some information about the comedian, and also registered if he/she went
or not.
Age Experience Rank Nationality Go

Dark mode
D k d
36 10 9 UK
Dark code
NO
42 12 4 USA NO
23 4 6 N NO
52 4 4 USA NO
43 21 8 USA YES
44 14 5 UK NO
66 3 7 N YES
35 14 9 UK YES
52 13 7 N YES
35 5 9 N YES
24 3 5 USA NO
18 3 7 UK YES
45 9 9 UK YES
Now, based on this data set, Python can create a decision tree that can be used to decide
if any new shows are worth attending to.
ADVERTISEMENT
Dark mode
D k d
Dark code
How
 Does
HTML
itCSS
Work?
JAVASCRIPT   
First, import the modules you need, and read the dataset with pandas:
Example
Read and print the data set:
import pandas
from sklearn import tree
import pydotplus
from sklearn.tree import DecisionTreeClassifier
import matplotlib.pyplot as plt
import matplotlib.image as pltimg
df = pandas.read_csv("shows.csv")
print(df)
Run example »
To make a decision tree, all data has to be numerical.
We have to convert the non numerical columns 'Nationality' and 'Go' into numerical
values.
Pandas has a map() method that takes a dictionary with information on how to convert
the values.
{'UK': 0, 'USA': 1, 'N': 2}
Means convert the values 'UK' to 0, 'USA' to 1, and 'N' to 2.
Example
Change string values into numerical values:
d = {'UK': 0, 'USA': 1, 'N': 2}

df['Nationality'] = df['Nationality'].map(d) Dark mode
D k d
d = {'YES': 1, 'NO': 0} Dark code
df['Go'] = df['Go'].map(d)
print(df)
Run example »
Then we have to separate the feature columns from the target column.
The feature columns are the columns that we try to predict from, and the target column
is the column with the values we try to predict.
Example
X is the feature columns, y is the target column:
features = ['Age', 'Experience', 'Rank', 'Nationality']
X = df[features]
y = df['Go']
print(X)
print(y)
Run example »
Now we can create the actual decision tree, fit it with our details, and save a .png file on
the computer:
Example
Create a Decision Tree, save it as an image, and show the image:
dtree = DecisionTreeClassifier()
dtree = dtree.fit(X, y)
data = tree.export_graphviz(dtree, out_file=None, feature_names=features)
graph = pydotplus.graph_from_dot_data(data)
Dark mode
graph.write_png('mydecisiontree.png')
D k d
Dark code
img=pltimg.imread('mydecisiontree.png')
imgplot = plt.imshow(img)
plt.show()
Run example »
Result Explained
The decision tree uses your earlier decisions to calculate the odds for you to wanting to
go see a comedian or not.
Let us read the different aspects of the decision tree:
Rank
Rank <= 6.5 means that every comedian with a rank of 6.5 or lower will follow the True
arrow (to the left), and the rest will follow the False arrow (to the right).
gini = 0.497 refers to the quality of the split, and is always a number between 0.0 and
0.5, where 0.0 would mean all of the samples got the same result, and 0.5 would mean
that the split is done exactly in the middle.
samples = 13 means that there are 13 comedians left at this point in the decision, which
is all of them since this is the first step.
value = [6, 7] means that of these 13 comedians, 6 will get a "NO", and 7 will get a
"GO".
Gini
Dark mode
D k d
Dark code
There are many ways to split the samples, we use the GINI method in this tutorial.
The Gini method uses this formula:
Gini = 1 - (x/n)2 - (y/n)2
Where x is the number of positive answers("GO"), n is the number of samples, and y

is the number of negative answers ("NO"), which gives us this calculation:
1 - (7 / 13)2 - (6 / 13)2 = 0.497
The next step contains two boxes, one box for the comedians with a 'Rank' of 6.5 or
lower, and one box with the rest.
True - 5 Comedians End Here:

gini = 0.0 means all of the samples got the same result.
samples = 5 means that there are 5 comedians left in this branch (5 comedian with a
Rank of 6.5 or lower).
value = [5, 0] means that 5 will get a "NO" and 0 will get a "GO".
False - 8 Comedians Continue:

Nationality
Nationality <= 0.5 means that the comedians with a nationality value of less than 0.5
Dark
will follow the arrow to the left (which means everyone from the UK, ), and the restmode
will
D k d
follow the arrow to the right.
Dark code
gini = 0.219 means that about 22% of the samples would go in one direction.
samples = 8 means that there are 8 comedians left in this branch (8 comedian with a
Rank higher than 6.5).
value = [1, 7] means that of these 8 comedians, 1 will get a "NO" and 7 will get a
"GO".
True - 4 Comedians Continue:

Age
Age <= 35.5 means that comedians at the age of 35.5 or younger will follow the arrow
to the left, and the rest will follow the arrow to the right.
gini = 0.375 means that about 37,5% of the samples would go in one direction.
samples = 4 means that there are 4 comedians left in this branch (4 comedians from
the UK).
"GO".
Dark mode
D k d
Dark code
False
 - 4 HTML
Comedians
CSS End Here:
JAVASCRIPT   
samples = 4 means that there are 4 comedians left in this branch (4 comedians not
from the UK).
"GO".
True - 2 Comedians End Here:

samples = 2 means that there are 2 comedians left in this branch (2 comedians at the
age 35.5 or younger).
"GO".
False - 2 Comedians Continue:

Experience
Dark mode
D k d
Dark code
Experience <= 9.5 means that comedians with 9.5 years of experience, or less, will
follow the arrow to the left, and the rest will follow the arrow to the right.
gini = 0.5 means that 50% of the samples would go in one direction.
samples = 2 means that there are 2 comedians left in this branch (2 comedians older
than 35.5).
"GO".
True - 1 Comedian Ends Here:

samples = 1 means that there is 1 comedian left in this branch (1 comedian with 9.5
years of experience or less).
False - 1 Comedian Ends Here:

samples = 1 means that there is 1 comedians left in this branch (1 comedian with more
than 9.5 years of experience).
Dark mode
D k d
Dark code
Predict
 Values
HTML CSS JAVASCRIPT   
We can use the Decision Tree to predict new values.
Example: Should I go see a show starring a 40 years old American comedian, with 10
years of experience, and a comedy ranking of 7?
Example
Use predict() method to predict new values:
print(dtree.predict([[40, 10, 7, 1]]))
Run example »
Example
What would the answer be if the comedy rank was 6?
print(dtree.predict([[40, 10, 6, 1]]))
Run example »
Different Results
You will see that the Decision Tree gives you different results if you run it enough times,
even if you feed it with the same data.
That is because the Decision Tree does not give us a 100% certain answer. It is based on
the probability of an outcome, and the answer will vary.
Dark mode
❮ Previous Next ❯
D k d
Dark code
ADVERTISEMENT
NEW
We just launched
W3Schools videos
Dark mode
D k d
Dark code
Explore now
COLOR PICKER

Get certified
by completing
a Python
course today!
school
w3 s
2
CE
02
TI 2
R
FI .
ED
Get started
CODE GAME
Dark mode
D k d
Dark code
Play Game
ADVERTISEMENT
Dark mode
D k d
Dark code
ADVERTISEMENT
ADVERTISEMENT
Report Error
Forum
About
Buy Certificate
Top Tutorials
HTML Tutorial
CSS Tutorial
JavaScript Tutorial
How To Tutorial Dark mode
D k d
SQL Tutorial Dark code
  HTML CSS JAVASCRIPT
Python Tutorial   
W3.CSS Tutorial
Bootstrap Tutorial
PHP Tutorial
Java Tutorial
C++ Tutorial
jQuery Tutorial
Top References
HTML Reference
CSS Reference
JavaScript Reference
SQL Reference
Python Reference
W3.CSS Reference
Bootstrap Reference
PHP Reference
HTML Colors
Java Reference
Angular Reference
jQuery Reference
Top Examples
HTML Examples
CSS Examples
JavaScript Examples
How To Examples
SQL Examples
Python Examples
W3.CSS Examples
Bootstrap Examples
PHP Examples
Java Examples
XML Examples
jQuery Examples
Web Courses
HTML Course
CSS Course
JavaScript Course
Front End Course
SQL Course
Python Course
PHP Course
jQuery Course
Java Course
C++ Course
C# Course
XML Course
Get Certified » Dark mode

D k d
Dark code
W3Schools HTML for learning
 is optimized CSS and JAVASCRIPT  and 
training. Examples might be simplified to improve reading learning.
Tutorials, references, and examples are constantly reviewed to avoid errors, but we cannot warrant full
correctness of all content. While using W3Schools, you agree to have read and accepted our terms of use,
cookie and privacy policy.
Copyright 1999-2022 by Refsnes Data. All Rights Reserved.

W3Schools is Powered by W3.CSS.

Python Machine Learning Decision Tree

Uploaded by

Copyright:

Available Formats

Python Machine Learning Decision Tree

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Python Machine Learning Decision Tree

Uploaded by

Copyright:

Available Formats

Dark code

  HTML CSS JAVASCRIPT   

Machine Learning - Decision Tree

Age Experience Rank Nationality Go

To make a decision tree, all data has to be numerical.

{'UK': 0, 'USA': 1, 'N': 2}

Means convert the values 'UK' to 0, 'USA' to 1, and 'N' to 2.

d = {'UK': 0, 'USA': 1, 'N': 2}

features = ['Age', 'Experience', 'Rank', 'Nationality']

Let us read the different aspects of the decision tree:

Gini = 1 - (x/n)2 - (y/n)2

Where x is the number of positive answers("GO"), n is the number of samples, and y

1 - (7 / 13)2 - (6 / 13)2 = 0.497

True - 5 Comedians End Here:

False - 8 Comedians Continue:

True - 4 Comedians Continue:

True - 2 Comedians End Here:

False - 2 Comedians Continue:

True - 1 Comedian Ends Here:

False - 1 Comedian Ends Here:

We can use the Decision Tree to predict new values.

print(dtree.predict([[40, 10, 7, 1]]))

print(dtree.predict([[40, 10, 6, 1]]))

Get Certified » Dark mode

Copyright 1999-2022 by Refsnes Data. All Rights Reserved.

You might also like