Least Square Method:

https://nptel.ac.in/content/storage2/courses/122104019/numerical-analysis/Rathish-kumar/least-
square/r1.htm

http://users.metu.edu.tr/csert/me310/me310_5_regression.pdf

Bayes Theorem

https://www.onlinemathlearning.com/bayes-
theorem.html#:~:text=Conditional%20Probability%20and%20Bayes'%20Theorem,is%20called%20a%
20false%20positive).

https://towardsdatascience.com/bayes-theorem-101-example-solution-ff54147d6c7f

EM Algorithm

http://web1.sph.emory.edu/users/hwu30/teaching/statcomp/Notes/Lecture3_EM.pdf

https://stats.stackexchange.com/questions/72774/numerical-example-to-understand-expectation-
maximization

SVM

http://math.bu.edu/people/mkon/SVMSolGeomL11.pdf

https://stats.stackexchange.com/questions/353552/support-vector-machine-calculate-w-by-hand

ID3

https://towardsdatascience.com/machine-learning-101-id3-decision-trees-and-entropy-calculation-
1-a1d66ee9f728

Perceptron

https://sefiks.com/2020/01/04/a-step-by-step-perceptron-example/

SOM

http://www.eis.mdx.ac.uk/staffpages/rvb/teaching/BIS3226/hand13.pdf

Bayesian Belief

http://people.cs.pitt.edu/~milos/courses/cs2001/cs2001-2.pdf

CNN

https://www.analyticsvidhya.com/blog/2018/12/guide-convolutional-neural-network-cnn/
https://towardsdatascience.com/covolutional-neural-network-cb0883dd6529

Genetic Algorithm

https://arxiv.org/ftp/arxiv/papers/1308/1308.4675.pdf

https://towardsdatascience.com/genetic-algorithm-explained-step-by-step-65358abe2bf

Find S

https://www.vtupulse.com/machine-learning/find-s-algorithm-maximally-specific-hypothesis/

Candidate Elimination Algorithm

https://www.cs.auckland.ac.nz/courses/compsci367s2c/tutorials/2010.d/Tutorial6.pdf

https://stackoverflow.com/questions/22625765/candidate-elimination-algorithm/22637185

KNN

https://people.revoledu.com/kardi/tutorial/KNN/KNN_Numerical-example.html

Locally Weighted Regression

https://datascience.stackexchange.com/questions/16850/understanding-locally-weighted-linear-
regression

Q-Learning

https://people.revoledu.com/kardi/tutorial/ReinforcementLearning/Q-Learning-Example.htm
 Printed Page: 1 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B.TECH.
(SEM V) THEORY EXAMINATION 2021-22
MACHINE LEARNING TECHNIQUES
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
Qno. Question Marks CO
a. What is a “Well -posed Learning “problem? Explain with an example. 2 CO1
b. What is Occam's razor in ML? 2 CO1
c. What is the role of Inductive Bias in ANN? 2 CO2
d. What is gradient descent delta rule? 2 CO2
e. What is Paired t Tests in Hypothesis evaluation? 2 CO3
f. How do you find the confidence interval for a hypothesis test? 2 CO3
g. What is sample complexity of a Learning Problem? 2 CO4
h. Differentiate between Lazy and Eager Learning 2 CO4
i. What is the problem of crowding in GA 2 CO5

1
j. Comparison of purely analytical and purely inductive learning. 2 CO5
90

13
_2

2.
SECTION B
1P

24
2. Attempt any three of the following:
2O

5.
.5
Qno. Question Marks CO
P2

17
a. Design the Final design of checkers learning program. 10 CO1
Q

b. What is Maximum Likelihood and Least Squared Error Hypothesis? 10 CO2

|1

c. What problem does the EM algorithm solve 10 CO3

04

d. Highlight the importance of Case Based Learning 10 CO4

0:

e. Write short notes on Learning First Order Rules 10 CO5

:0
09

SECTION C
2

3. Attempt any one part of the following:

02

Qno. Question Marks CO

-2

a. Explain the “Concept Learning” Task Giving an example 10 CO1

n

b. Find the maximally general hypothesis and maximally specific hypothesis 10 CO1
Ja

for the training examples given in the table using the candidate elimination
0-

algorithm.
|1

Given Training Example:

Sky Temp Humidity wind water Forecast sport

Sunny warm Normal Strong warm same Yes

1|Page
QP22O1P_290 | 10-Jan-2022 09:00:04 | 117.55.242.131
 Printed Page: 2 of 2
Subject Code: KCS055
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

Sunny warm High Strong warm same Yes

Rainy cold High Strong warm change No

Sunny warm High Strong cool change Yes

4. Attempt any one part of the following:

Qno. Question Marks CO
a. Comment on the Algorithmic convergence & Generalization property of 10 CO2
ANN.
b. Discuss the following issues in Decision Tree Learning: 10 CO2
1. Overfitting the data
2. Guarding against bad attribute choices
3. Handling continuous valued attributes
4. Handling missing attribute values
5. Handling attributes with differing costs

1
90

13
_2

2.
5. Attempt any one part of the following:
1P

24
Qno. Question Marks CO
2O

5.
a. How is Naïve Bayesian Classifier different from Bayesian Classifier? 10 CO3

.5
P2

b. Explain the role of Central Limit Theorem Approach for deriving 10 CO3
17
Confidence Interval.
Q

|1

6. Attempt any one part of the following:

04

Qno. Question Marks CO

0:

a. Write short notes on Probably Approximately Correct (PAC) learning 10 CO4

:0

model.
09

b. Discuss various Mistake Bound Model of Learning 10 CO4

2
02

7. Attempt any one part of the following:

-2

Qno. Question Marks CO

n
Ja

a. What is the significance of Learn -one Rule Algorithm? 10 CO5

0-

b. Describe a prototypical genetic algorithm along with various operations 10 CO5

possible in it.
|1

2|Page
QP22O1P_290 | 10-Jan-2022 09:00:04 | 117.55.242.131