0% found this document useful (0 votes)
30 views4 pages

CP4252 Set2

The document outlines the practical examination for the M.E / M.Tech. in Machine Learning for the third semester, detailing various programming tasks and algorithms to be implemented, such as linear regression, decision trees, logistic regression, k-Nearest Neighbour, k-Means clustering, and Naïve Bayes classifier. Each task specifies the use of appropriate datasets and programming languages, primarily Python or Java, to demonstrate the application of machine learning techniques. The examination is structured to assess students on their ability to implement algorithms, analyze data, and interpret results.

Uploaded by

shohi
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
0% found this document useful (0 votes)
30 views4 pages

CP4252 Set2

The document outlines the practical examination for the M.E / M.Tech. in Machine Learning for the third semester, detailing various programming tasks and algorithms to be implemented, such as linear regression, decision trees, logistic regression, k-Nearest Neighbour, k-Means clustering, and Naïve Bayes classifier. Each task specifies the use of appropriate datasets and programming languages, primarily Python or Java, to demonstrate the application of machine learning techniques. The examination is structured to assess students on their ability to implement algorithms, analyze data, and interpret results.

Uploaded by

shohi
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/ 4

M.E / M.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, NOVEMBER / DECEMBER 2022

Third Semester

CP4252 - MACHINE LEARNING

(Regulations 2021)

Time : 3 Hours Answer any one Question Max. Marks 100

Aim/Principle/Apparatu Tabulation/Circui Calculation Viva-Voce Recor Total


s required/Procedure t/Program/Drawin & Results d
g
30 20 30 10 10 100

1. Implement simple linear regression to predict profits for a food truck based on the
population of the city that the truck would be placed in.

2. 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.

3. Build a classification model that estimates the probability of admission based on the exam
scores using logistic regression.

4. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set.
Print both correct and wrong predictions using Python ML library classes.

5. Write a program to implement k-Means clustering algorithm to cluster the set of data
stored in .CSV file. Compare the results of various “k” values for the quality of clustering.

6. Implement an algorithm to demonstrate the significance of Genetic algorithm.

7. Implement the unsupervised learning algorithm using K-means clustering.

Page 1 of 4
8. Using Naïve Bayes classifier make a prediction of the class to which the below cases
belongs to:

a) X1 = (age=‘31..40’, income=‘high’, student = ‘yes’, status=‘single’)

b) X2 = (age=‘<=30’, income=‘high’, student = ‘yes’, status=‘married’)

c) X3 = (age=‘>40, income=‘medium’, student = ‘no’, status=‘married’)

9. Write a program to implement the Naïve Bayesian classifier for a sample training data set
stored as a .CSV file. Compute the accuracy of the classifier, considering few test data
sets

10. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the above 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.

Page 2 of 4
11. Consider the above 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.

12 Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.

13. 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.

14. Import any CSV file to Pandas DataFrame and perform the following:

a. Visualize the first and last 10 records

b. Get the shape, index and column details.

c. Select/Delete the records(rows)/columns based on conditions.

d. Perform ranking and sorting operations.

e. Do required statistical operations on the given columns.

f. Find the count and uniqueness of the given categorical values.

g. Rename single/multiple columns

15. Build a classification model that estimates the probability of admission based on the exam
scores using logistic regression.

16. Implement un-regularized and regularized versions of the neural network cost function and
compute gradients via the backpropagation algorithm.

17. Write a program to construct a Bayesian network considering medical data. Use this model
to demonstrate the diagnosis of heart patients using standard Heart Disease Data Set.
You can use Java/Python ML library classes/API.

Page 3 of 4
18. Build a Convolutional Neural Network for Cat vs Dog Image Classification using Kaggle.

19. Implement the non-parametric Locally Weighted Regression algorithm in order to fit data
points. Select appropriate data set for your experiment and draw graphs.

20. Build an Artificial Neural Network by implementing the Backpropagation algorithm and test
the same using appropriate data sets.

Page 4 of 4

You might also like