16SCS31
16SCS31
USN
/SFC254/SIT322/SSE334
Ph.D./M.Sc. (Engg.) by Research Degree Examination, Feb./Mar.2020
Machine Learning Techniques
Time: 3 hrs. Max. Marks: 100
Note: Answer any FIVE full questions, choosing ONE full question from each module.
Module-1
1 a. Apply candidate elimination algorithm for the following training data set:
RID Origin Manufacturer Color Decade Type Class
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.
b. Explain how ID3 algorithm is specialized in learning Boolean Valued functions. (08 Marks)
OR
2 a. Apply Find-S algorithm, to find the most specific hypothesis for the following training data
set. (08 Marks)
RID Domain Platform Browser Day Scrum Country Click
1. Edu Mac Net-3 Mon XVGA America Yes
2. Com Mac Net com Tue XVGA America Yes
3. Com PC IE Sat VGA Europe No
4. Org Unix Net-2 Wed XVGA America Yes
5. Com Unix Net-2 Wed XVGA Europe Yes
b. Summarize the various generic issues in Machine Learning. (06 Marks)
c. Explain the context involved in designing a “Learning System” for checkers program.
(06 Marks)
Module-2
3 a. Explain the characteristics of the appropriate problem suitable for Artificial Neural Network
application. (06 Marks)
b. Outline the steps involved in training a linear unit using gradient descent algorithm.
(06 Marks)
c. Summarize the steps involved in back propagation algorithm using stochastic gradient
descent. (08 Marks)
OR
4 a. Explain the steps involved in prototypical genetic algorithm. (08 Marks)
b. Recall Lamarckian concept of evolution in genetics. (06 Marks)
c. Illustrate the application of genetic programming, with a suitable example. (06 Marks)
Module-3
5 a. Consider the following data set for classifying a fruit:
Fruit Long Sweet Yellow Total
Banana 400 350 450 500
Orange 0 150 300 300
Other 100 150 50 200
Total 500 650 800 1000
Apply Bayes Theorem to classify the new instance of a fruit with: Long-Sweet-Yellow
Attribute? (12 Marks)
b. Explain Bayesian belief networks, with a suitable example. (08 Marks)
1 of 2
16SCS31/LNI322/SCE321/SCN324
/SFC254/SIT322/SSE334
OR
6 a. Find whether the new instance of a car with Red-SUV-Domestic attribute will be stolen or
not by applying m-estimate approach of Naïve Bayes classifier for the following data set:
(m = 3).
RID Color Type Origin Stolen?
1. Red Sports Domestic Yes
2. Red Sports Domestic No
3. Red Sports Domestic Yes
4. Yellow Sports Domestic No
5. Yellow Sports Imported Yes
6. Yellow SUV Imported No
7. Yellow SUV Imported Yes
8. Yellow SUV Domestic No
9. Red SUV Imported No
10. Red Sports Imported Yes
(12 Marks)
b. Explain how Gibb’s algorithm overcomes the drawback of Bayes optimal classifier.
(08 Marks)
Module-4
7 a. Following data set contains types of tissues produced by a company and its client’s
response:
Type of Tissue Acid Durability Strength Class
Type-1 7 7 Bad
Type-2 7 4 Bad
Type-3 3 4 Good
Type-4 1 4 Good
Find the class label of the new instance (test data) with acid durability = 3, strength = 7
using K-NN Algorithm (number of nearest neighbors : K = 0.3). (10 Marks)
b. Summarize the working principle of Radial Basis Function with a neat labeled block
diagram. (10 Marks)
OR
8 a. Explain sequential covering algorithm with a suitable example. (06 Marks)
b. Summarize the basic FOIL algorithm used for generating learned rules. (08 Marks)
c. Illustrate the process of generating candidate specialization using FOIL’s approach.
(06 Marks)
Module-5
9 a. Outline the explanation based learning algorithm “PROLOG-EBG”. (08 Marks)
b. Illustrate the working principle of ‘Q’ learning algorithm with a suitable example. (12 Marks)
OR
10 a. Explain the working principle of FOCL algorithm. (10 Marks)
b. Write a note on Temporal Difference Learning. (06 Marks)
c. Compare Inductive Learning and Analytical learning approaches. (04 Marks)
*****
2 of 2