The document describes building a decision tree using the ID3 algorithm to classify whether to play tennis based on a dataset with attributes like outlook, temperature, humidity, and wind. It involves reading the dataset, calculating information gain to determine the best attribute to split on, recursively building the tree by splitting on attributes and creating leaf nodes, and then printing the resulting decision tree.
The document describes building a decision tree using the ID3 algorithm to classify whether to play tennis based on a dataset with attributes like outlook, temperature, humidity, and wind. It involves reading the dataset, calculating information gain to determine the best attribute to split on, recursively building the tree by splitting on attributes and creating leaf nodes, and then printing the resulting decision tree.
The document describes building a decision tree using the ID3 algorithm to classify whether to play tennis based on a dataset with attributes like outlook, temperature, humidity, and wind. It involves reading the dataset, calculating information gain to determine the best attribute to split on, recursively building the tree by splitting on attributes and creating leaf nodes, and then printing the resulting decision tree.
The document describes building a decision tree using the ID3 algorithm to classify whether to play tennis based on a dataset with attributes like outlook, temperature, humidity, and wind. It involves reading the dataset, calculating information gain to determine the best attribute to split on, recursively building the tree by splitting on attributes and creating leaf nodes, and then printing the resulting decision tree.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 6
Exp. No. 3.
Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an appropriate data set for building the decision tree and apply this knowledge to classify a new sample.
Dataset:
PlayTennis Dataset is saved as .csv (comma separated values) file in the current working directory otherwise use the complete path of the dataset set in the program:
Day Outlook Temperature Humidity Wind PlayTennis
D1 Sunny Hot High Weak No
D2 Sunny Hot High Strong No
D3 Overcast Hot High Weak Yes
D4 Rain Mild High Weak Yes
D5 Rain Cool Normal Weak Yes
D6 Rain Cool Normal Strong No
D7 Overcast Cool Normal Strong Yes
D8 Sunny Mild High Weak No
D9 Sunny Cool Normal Weak Yes
D10 Rain Mild Normal Weak Yes
D11 Sunny Mild Normal Strong Yes
D12 Overcast Mild High Strong Yes
D13 Overcast Hot Normal Weak Yes
D14 Rain Mild High Strong No
import pandas as pd
import math
import numpy as np
data = pd.read_csv("3-dataset.csv")
features = [feat for feat in data]
features.remove("answer")
class Node:
def __init__(self):
self.children = []
self.value = ""
self.isLeaf = False
self.pred = ""
def entropy(examples):
pos = 0.0
neg = 0.0
for _, row in examples.iterrows():
if row["answer"] == "yes":
pos += 1 else:
neg += 1
if pos == 0.0 or neg == 0.0:
return 0.0
else:
p = pos / (pos + neg)
n = neg / (pos + neg)
return -(p * math.log(p, 2) + n * math.log(n, 2))
def info_gain(examples, attr):
uniq = np.unique(examples[attr])
#print ("\n",uniq)
gain = entropy(examples)
#print ("\n",gain)
for u in uniq:
subdata = examples[examples[attr] == u]
#print ("\n",subdata)
sub_e = entropy(subdata)
gain -= (float(len(subdata)) / float(len(examples))) * sub_e
