Scribd
Upload
3 views2 pages

ML Tutorial 3

The document outlines a tutorial for a Machine Learning course, including various tasks such as assessing student performance using the Naïve Bayes algorithm, elaborating on activation functions in Artificial Neural Networks (ANNs), and applying clustering techniques like k-means. It also covers reinforcement learning components and algorithms like Q-learning and SARSA. Additionally, it includes practical exercises involving distance calculations and perceptron design for Boolean functions.

Uploaded by

bhoomikanatarajac
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
3 views2 pages

ML Tutorial 3

The document outlines a tutorial for a Machine Learning course, including various tasks such as assessing student performance using the Naïve Bayes algorithm, elaborating on activation functions in Artificial Neural Networks (ANNs), and applying clustering techniques like k-means. It also covers reinforcement learning components and algorithms like Q-learning and SARSA. Additionally, it includes practical exercises involving distance calculations and perceptron design for Boolean functions.

Uploaded by

bhoomikanatarajac
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

Department of Information Science &Engineering

TUTORIALS -III
Subject Name & Code: Machine Learning [BCS602]
Semester: VI DATE: 06/05/2026
1. Assess a student’s performance using Naïve Bayes algorithm with the dataset provided
in Table. Given the test data = (CGPA ≥9, Interactiveness = Yes, Practical
knowledge(PK) = Average, Communication Skills(CS) = Good), apply the Bayes
theorem to classify whether the given student gets a Job offer or not.
S. No. CGPA Interactiveness PK CS Job Offer
1 ≥9 Yes Very good Good Yes
2 ≥8 Yes Good Moderate Yes
3 ≥9 No Average Poor No
4 <8 No Average Good No
5 ≥8 Yes Good Moderate Yes
6 ≥9 Yes Good Moderate Yes
7 <8 Yes Good Poor No
8 ≥9 No Very good Good Yes
9 ≥8 Yes Good Good Yes
10 ≥8 Yes Average Good Yes

2. Assess a student’s performance using Naïve Bayes algorithm using continuous


attribute with the dataset provided in Table. Given the test data = (CGPA =8.5,
Interactiveness = Yes). Apply the Bayes theorem to classify whether the given student
gets a Job offer or not.
S. No. CGPA Interactiveness Job Offer
1 9.5 Yes Yes
2 8.2 No Yes
3 9.3 No No
4 7.6 No No
5 8.4 Yes Yes
6 9.1 Yes Yes
7 7.5 Yes No
8 9.6 No Yes
9 8.6 Yes Yes
10 8.3 Yes Yes

3. Elaborate the activation functions used in Artificial Neuron Networks that contribute to
the construction of the network.
4. Consider a perceptron to represent the Boolean function AND with the initial weights
w1=0.3, w2=-0.2, learning rate α=0.2 and bias θ=0.4. The activation function used here is
the step function f(x) which gives the output values as binary. Design a perceptron that
performs the Boolean function AND and update the weights until the Boolean function
gives the desired output.
5. With neat Sketch explain the types of ANN.
6. Explain how Artificial Neural Networks (ANNs) are applied in real-world scenarios.
Discuss their advantages and disadvantages, and identify key challenges faced during
their implementation.
7. Find the Manhattan and Chebyshev distance if the coordinates of the objects are (0,3) and
(5,8).
8. Consider the following set of data given. Apply k-means algorithm and cluster it using
initial value of objects 2 and 5 with coordinate values (4, 6) and (12, 4) as initial needs.
Objects X-coordinate Y-coordinate
1 2 4
2 4 6
3 6 8
4 10 4
5 12 4
9. State and explain different components of Reinforcement learning.
10. Explain Q-learning and State-Action-Reward-State-Action (SARSA) learning algorithms.
11. State and explain different methods of model free techniques.

You might also like