Scribd
Upload
32 views2 pages

Find S Algo

The document outlines the implementation of the FIND-S algorithm to determine the most specific hypothesis from a training dataset stored in a CSV file. It includes a Python program that reads the data, initializes a hypothesis, and iteratively updates it based on positive training examples. The final output reveals the maximally specific hypothesis derived from the provided training data.

Uploaded by

visheshadarsh393
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views2 pages

Find S Algo

The document outlines the implementation of the FIND-S algorithm to determine the most specific hypothesis from a training dataset stored in a CSV file. It includes a Python program that reads the data, initializes a hypothesis, and iteratively updates it based on positive training examples. The final output reveals the maximally specific hypothesis derived from the provided training data.

Uploaded by

visheshadarsh393
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Aim: Implement and demonstrate the FIND-S algorithm for finding the

most specific hypothesis based on a given set of training data samples. Read
the training data from a .CSV file.
Program:-
Program:
import csv

num_attributes = 6 a = [ ]
print("\n The Given Training Data Set \n")

with open('enjoysport.csv', 'r') as csvfile: reader = csv.reader(csvfile)


for row in reader: a.append (row) print(row)

print("\n The initial value of hypothesis: ") hypothesis = ['0'] * num_attributes print(hypothesis)

for j in range(0,num_attributes): hypothesis[j] = a[0][j];

print("\n Find S: Finding a Maximally Specific Hypothesis\n") for i in range(0,len(a)):


if a[i][num_attributes]=='yes':
for j in range(0,num_attributes): if a[i][j]!=hypothesis[j]:
hypothesis[j]='?' else :
hypothesis[j]= a[i][j]
print(" For Training instance No:{0} the hypothesis is ".format(i),hypothesis)

print("\n The Maximally Specific Hypothesis for a given Training Examples :\n")
print(hypothesis)

Data Set:
sunny warm normal strong warm same yes
sunny warm high strong warm same yes
rainy cold high strong warm change no
sunny warm high strong cool change yes

Output:

The Given Training Data Set

['sunny', 'warm', 'normal', 'strong', 'warm', 'same', 'yes']


['sunny', 'warm', 'high', 'strong', 'warm', 'same', 'yes']
['rainy', 'cold', 'high', 'strong', 'warm', 'change', 'no']
['sunny', 'warm', 'high', 'strong', 'cool', 'change', 'yes']

The initial value of hypothesis:


['0', '0', '0', '0', '0', '0']
Find S: Finding a Maximally Specific Hypothesis For Training Example No:0 the hypothesis is
['sunny', 'warm', 'normal', 'strong', 'warm', 'same']

For Training Example No:1 the hypothesis is ['sunny', 'warm', '?', 'strong', 'warm', 'same']

For Training Example No:2 the hypothesis is 'sunny', 'warm', '?', 'strong', 'warm', 'same']

For Training Example No:3 the hypothesis is 'sunny', 'warm', '?', 'strong', '?', '?']

The Maximally Specific Hypothesis for a given Training Examples:

['sunny', 'warm', '?', 'strong', '?', '?']

You might also like