Scribd
Upload
37 views20 pages

Manjunath 01JST18EI023

F c k u

Uploaded by

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

Manjunath 01JST18EI023

F c k u

Uploaded by

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

1.

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.
2. For a given set of training data examples stored in a .CSV file, implement and demonstrate
the Candidate-Elimination algorithm to output a description of the set of all hypotheses
consistent with the training examples.
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.
4.Build an Artificial Neural Network by implementing the Backpropagation algorithm and
test the same using appropriate data sets.
1)epoch > 500
ii) epoch = 500
5. Assuming a set of documents that need to be classified, use
the naïve Bayesian Classifier model to perform this task. Built-in
Java classes/API can be used to write the program. Calculate the
accuracy, precision, and recall for your data set.
6. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set
for clustering using k-Means algorithm. Compare the results of these two algorithms and
comment on the quality of clustering. You can add Java/Python ML library classes/API
in the program.
7. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set.
Print both correct and wrong predictions. Java/Python ML library classes can be used for
this problem.
8. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.

You might also like