Question: ( 6 3 marks ) Assume you have the table below containing information about the Golden Gophers soccer games. For every game recorded, there is

(63 marks) Assume you have the table below containing information about the Golden Gophers
soccer games. For every game recorded, there is an entry (e.g. row) for whether it took place on a
Friday, Saturday, or Sunday, whether the team's star, Whirling Willie, started the game or came in
off the bench later, whether the defenseman Donnie played on the left or right of the field, whether
the offensive player Otto played on the left or right of the field, whether the opponent's team was
on average young (below 22 years of age) or old, and, finally, whether the Golden Gophers won
or lost. Suppose "Outcome" is the target/label attribute with "Won" labeling positive (+) and
"Lost" labeling negative (-). Use ID3 to learn a decision tree. You are required to show how you
calculate the information entropy for selecting attributes in every step in detail. For the selection
of attribute at each node of the tree, show:
the calculation of conditional information entropy for each candidate attribute (including the
cases of all its possible values);
the selection of attribute based on the conditional information entropy;
the partial/final decision tree once the attribute is selected;
the rule(s) if any.
Note: ID is not a conditional attribute.
\begin{tabular}{|c||c|c|c|c|c||c|}
\hline ID & When & WW Starts & Donnie & Otto & OppAge & Outcome \\
\hline \hline 1 & Sat & Yes & Left & Left & Young & Won (+)\\
2 & Sat & Yes & Left & Left & Old & Won (+)\\
3 & Sat & Yes & Left & Left & Old & Won (+)\\
4 & Sat & Yes & Left & Right & Young & Won (+)\\
5 & Sat & Yes & Left & Right & Young & Won (+)\\
6 & Sat & Yes & Left & Right & Old & Won (+)\\
7 & Sat & Yes & Right & Left & Old & Won (+)\\
8 & Sat & Yes & Right & Right & Young & Won (+)\\
9 & Sat & No & Left & Right & Young & Won (+)\\
10 & Sun & No & Left & Left & Young & Won (+)\\
11 & Sun & No & Left & Right & Young & Won (+)\\
& & & & & & \\
12 & Fri & Yes & Left & Right & Old & Lost (-)\\
13 & Fri & Yes & Right & Right & Old & Lost (-)\\
14 & Fri & No & Right & Left & Old & Lost (-)\\
15 & Fri & No & Right & Right & Old & Lost (-)\\
16 & Sat & No & Left & Left & Young & Lost (-)\\
17 & Sat & No & Right & Left & Young & Lost (-)\\
18 & Sat & No & Right & Right & Old & Lost (-)\\
19 & Sun & No & Right & Left & Young & Lost (-)\\
20 & Sun & No & Right & Left & Old & Lost (-)\\
\hline
\end{tabular}
( 6 3 marks ) Assume you have the table below

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!