0% found this document useful (0 votes)
23 views12 pages

AIML II Test Scheme and Soluion 2023

Uploaded by

Vijeth T M
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)
23 views12 pages

AIML II Test Scheme and Soluion 2023

Uploaded by

Vijeth T M
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/ 12

USN 1 R N C S

RNS Institute of Technology


Department of CSE
VII Semester - II Test – Nov 2023
Artificial Intelligence & Machine Learning (18CS71)
Duration: 90 mins. Max Marks: 50 Time: 9:00-10:40 am Date: 23/11/2023
NOTE: Answer FIVE full questions.
Don’t write anything on question paper other than USN.
Qn.No. Questions Marks BCL CO
1 a) Define Bayesian Learning. Describe the practical difficulty in applying Bayesian
1+4 L1 CO4
methods.
b) Discuss Maximum Likelihood and Least Square Error Hypothesis. 5 L2 CO4
OR
2 a) The following dataset gives information about a person buys a computer or not.
Using the Naive Bayes classifier classify the new instance.
age=youth, income=medium, student=yes,credit_rating=fair,buys_computer = ?
VISION: Preparing better computer professionals for a real world

Age Income Student Credit_rating Buys-computer


Youth Low No Fair Yes
Youth High Yes Excellent No
Youth High No Fair Yes
6 L3 CO4
Middle Medium Yes Fair Yes
Senior Low Yes Fair Yes
Senior Low Yes Excellent Yes
Middle High Yes Excellent Yes
Youth Medim No Fair No
Middle Low No Excellent Yes
Senior Medium Yes Fair Yes

b) Explain Bayesian belief network and conditional independence with an example. 4 L3 CO4

3 a) Discuss Minimum Description Length principle used in Bayesian Learning. 6 L2 CO4


b) Write Brute Force Map Learning Algorithm. 4 L3 CO4
OR
4 a) Write Naive Bayes Classification Algorithm for classification. 5 L3 CO4
b) Explain the Gradient Search to Maximize Likelihood in a Neural Network 5 L3 CO4

5 a) Write k-means Algorithm. 5 L3 CO4


b) Explain the concept of EM Algorithm and mention its essence. 5 L3 CO4
OR
6 a) Describe K-nearest Neighbor learning Algorithm for continues valued target
5 L2 CO5
function.
b) Discuss the advantages and major drawbacks of K-nearest Neighbor
5 L3 CO5
learning Algorithm

7 a) Explain Radial Basis Function Networks with an example and mention the two
6 L2 CO5
stage process used to train the RBF.
b) Write short notes on CADET System. 4 L2 CO5
OR
8 a) Apply K nearest neighbor classifier to predict the patient is a diabetic patient or not
with the given features BMI,Age. Assume K=3 Test Example BMI=43.6, Age=40, 5 L3 CO5
Sugar =?. Training examples are as follows:

Bloom’s Cognitive Levels (BCL): L1: Remember, L2: Understand, L3: Apply, L4: Analyze, L5: Evaluate, L6: Create
BMI Age Diabetes
33.6 50 1
26.6 30 0
23.4 40 0
43.1 67 0
35.3 23 1
35.9 67 1
36.7 45 1
25.7 46 0
23.3 29 0
31 56 1

b) Derive Locally Weighted Linear Regression local approximation for the target
5 L3 CO5
function

9 a) What is Reinforcement Learning? Explain the aspects which make Reinforcement L1,
2+4 CO6
Learning different from other. L2
b) Explain Q learning algorithm assuming deterministic rewards and actions. 4 L3 CO6
OR
10 a) Explain the elements of reinforcement learning with a neat diagram. 6 L2 CO6
b) Explain Q Function w.r.t Reinforcement Learning 4 L2 CO6

VII Semester QUIZ-II-Nov 2023

Duration: 10 mins. Note: Answer all full questions Max Marks: 10

Q.No. Questions Marks CO


1. Which learning approach uses Training Data with Targets? 1 CO4
a)Reinforcement b) Supervised c)Unsupervised
2. What is unsupervised learning? 1 CO5
a) Number of groups may be known b) features of group are explicitly stated c)Neither
features nor number of groups is known d) none of these
3. Conditional probability is the probability of an event A based on the occurrence of 1 CO4
another event B.
a)True b)False
4. Which of the following is true about reinforcement learning? 1 CO6
a) The agent gets rewards or penalty according to the action b)The target of an agent is to
maximize the rewards c) All of these
5. Which of the following is a limitation of k-means clustering? 1 CO5
a)It requires the number of clusters to be specified in advance.
b)It cannot handle categorical data. c)both of these d)none of these
6. You have a dataset of different flowers containing their petal lengths and color. Your 1 CO4
model has to predict the type of flower for given petal lengths and color. This is a-
a) Regression task b) Classification task c)Clustering task d) None of these
7. In Reinforcement Learning an agent receives ------ 1 CO6
a)reward b)penalty c)any one of these d) both of these
8. How many terms are required for building a Bayes model? 1 CO4
a) 1 b) 2 c) 3 d) 4
9. Which of the following is a lazy learning algorithm? 1 CO5
a) SVM b) KNN c) Decision tree d) All of these
10 The goal of clustering is to: 1 CO5
a)Divide the data points into groups b) Predict the output values of input data points.
c)both of these d)none of these.
Course Outcomes (CO):
CO4: Implement Bayesian Techniques.
CO5: Investigate instance based learning.
CO6: Evaluate hypothesis and examine reinforcement learning.
Bloom’s Cognitive Levels (BCL): L1: Remember, L2: Understand, L3: Apply, L4: Analyze, L5: Evaluate, L6: Create
SUBJECT CODE : 18CS61 SUBJECT: Artificial Intelligence and Machine Learning STAFF: Dr.ANR
SCHEME AND SOLUTION
QNO MARKS

1. a) Bayesian methods provide a coherent and principled way to handle uncertainty and make predictions. 1+4
Bayesian learning is a statistical framework for updating beliefs or probabilities based on new evidence or
data.
Computational Complexity: Bayesian inference often involves complex mathematical calculations,
especially when dealing with high-dimensional data or complex models. Computing the exact posterior
distribution can be computationally intensive and, in some cases, analytically intractable.
Data-Driven Priors: Bayesian learning heavily relies on the choice of priors, which represent beliefs
about the parameters before observing data.
Model Specification: The accuracy of Bayesian inference depends on the correctness of the chosen model.
If the model does not capture the underlying data-generating process accurately, the results may be
unreliable.
Interpretability and Communication: Bayesian results are often expressed in terms of probability
distributions, which may be more challenging for non-experts to interpret compared to point estimates
provided by frequentist methods.

b) Maximum Likelihood Estimation (MLE) is a statistical method used to estimate the parameters of a 5
model. In some cases we will assume that every hypothesis in H is equally probable a priori (P(hi) = P(hj)
for all hi in H ) In this case we can further simplify and need only consider the term P(D|h) to find the most
probable hypothesis. P(D|h) is often called the likelihood of the data D given h and any hypothesis that
maximizes P(D|h) is called a Maximum likelihood (ML) hypothesis hML

Least Squares Error (LSE) is a method used for estimating the parameters of a model by minimizing the
sum of squared differences between the observed and predicted values.
Training examples <xi, di>, where di is noisy training value di = f (xi) + ei
ei is random variable (noise) drawn independently for each xi according to some Gaussian distribution with
mean=0 Then the maximum likelihood hypothesis h ML is the one that minimizes the sum of squared errors.

2. a)
SCHEM E AND SOLUTION
QNO MARKS
6

b) A Bayesian Belief Network (BBN), also known as a Bayesian Network or a Probabilistic Graphical 4
Model, is a graphical representation of probabilistic relationships among a set of variables.
X is conditionally independent of Y given Z if the probability distribution governing X is independent of
the value of Y given the value of Z; that is, if
(xi, yj, zk) P(X= xi|Y= yj, Z= zk) = P(X= xi|Z= zk)
P(X|Y, Z) = P(X|Z)
Example: Thunder is conditionally independent of Rain, given Lightning
P(Thunder|Rain, Lightning) = P(Thunder|Lightning)
SCHEM E AND SOLUTION
QNO MARKS
3 a) In Bayesian learning, the MDL principle is applied to model selection, where one aims to choose the
most appropriate model from a set of candidate models. The MDL principle is closely related to Occam's 2+4= 6
razor, which suggests that among competing hypotheses that explain the observed data equally well,
one should prefer the simpler one.

4
b) For each hypothesis h in H, calculate the posterior probability.

Output the hypothesis hMAP with the highest posterior probability.

.
SCHEM E AND SOLUTION
QNO MARKS
4
5

a) .
b)

.
SCHEM E AND SOLUTION
QNO MARKS
5 a) 1. The sample space is initially partitioned into K clusters and the observations are randomly 5
assigned to the clusters.
2. For each sample:
Calculate the distance from the observation to the centroid of the cluster.
IF the sample is closest to its own cluster THEN leave it ELSE select another cluster.
3. Repeat steps 1 and 2 untill no observations are moved from one cluster to another

b) EM Algorithm
2+3=5

Essence of EM Approach

.
SCHEM E AND SOLUTION
QNO MARKS
6 a) 5

b) 5

.
SCHEM E AND SOLUTION
QNO MARKS
7 2+4
a)

• The CADET system employs case- based reasoning to assist in the conceptual design of simple 4
mechanical devices such as water faucets. It uses a library containing approximately 75 previous
designs and design fragments to suggest conceptual designs to meet the specifications of new
design problems. Each instance stored in memory (e.g., a water pipe) is represented by describing
both its structure and its qualitative function. New design problems are then presented by specifying
the desired function and requesting the corresponding structure.

.
SCHEM E AND SOLUTION
QNO MARKS
8 a) 5

b)
5

.
SCHEM E AND SOLUTION
QNO MARKS
9 a) 5
Reinforcement learning addresses the question of how an autonomous agent that senses and acts in its
environment can learn to choose optimal actions to achieve its goals. The reinforcement learning problem
differs from other function approximation tasks in several important respects.
• Delayed reward: Determining which of the actions in its sequence are to be credited with producing
the eventual rewards
• Exploration : The learner faces a tradeoff in choosing whether to favor exploration of unknown states
and actions (to gather new information), or exploitation of states and actions that it has already
learned will yield high reward (to maximize its cumulative reward).
• Partially observable states: in many practical situation's sensors provide only partial information.
• Life-long learning

b) 5

10 a)
2+3= 5

• An agent interacting with its environment. The agent exists in an environment described by some set of
possible states S.
• It can perform any of a set of possible actions A. Each time it performs an action a, in some state st the
agent receives a real-valued reward r, that indicates the immediate value of this state-action transition.
This produces a sequence of states si, actions ai, and immediate rewards ri as shown in the figure.
• The agent's task is to learn a control policy, π : S -> A, that maximizes the expected sum of these
. rewards, with future rewards discounted exponentially by their delay
SCHEM E AND SOLUTION
QNO MARKS
10 b) 5

------------------------------------------------********************-----------------------------------------------------
AIML QUIZ-II

1. Which learning approach uses Training Data with Targets?


a)Reinforcement b) Supervised c)Unsupervised
2. What is unsupervised learning?
a) Number of groups may be known b) features of group are explicitly stated c)Neither
features nor number of groups is known d) none of these
3. Conditional probability is the probability of an event A based on the occurrence of another event
B.
a)True b)False
4. Which of the following is true about reinforcement learning?
a) The agent gets rewards or penalty according to the action b)The target of an agent is to
maximize the rewards c) All of these
5. Which of the following is a limitation of k-means clustering?
a)It requires the number of clusters to be specified in advance.
b)It cannot handle categorical data. c)both of these d)none of these
6. You have a dataset of different flowers containing their petal lengths and color. Your model has
to predict the type of flower for given petal lengths and color. This is a-
a) Regression task b) Classification task c)Clustering task d) None of these
7. In Reinforcement Learning an agent receives ------
a)reward b)penalty c)any one of these d) both of these
8. How many terms are required for building a Bayes model?
a) 1 b) 2 c) 3 d) 4
9. Which of the following is a lazy learning algorithm?
a) SVM b) KNN c) Decision tree d) All of these
10 The goal of clustering is to:
a)Divide the data points into groups b) Predict the output values of input data points.
. c)both of these d)none of these.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy