100% found this document useful (3 votes)
1K views

Cp5191 Machine Learning Techniques

1. The document is a machine learning techniques exam question paper that contains multiple choice and long answer questions. 2. It covers a wide range of machine learning topics including types of machine learning, perceptrons, splines, radial basis function networks, ensemble learning, classification vs regression, dimensionality reduction, evolutionary computation, sampling, and Bayesian networks. 3. The long answer questions require explaining concepts like linear regression, multi-layer perceptrons, support vector machines, classification and regression trees, K-means clustering, principal component analysis, reinforcement learning, hidden Markov models, genetic algorithms, and decision trees.

Uploaded by

akexample
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
100% found this document useful (3 votes)
1K views

Cp5191 Machine Learning Techniques

1. The document is a machine learning techniques exam question paper that contains multiple choice and long answer questions. 2. It covers a wide range of machine learning topics including types of machine learning, perceptrons, splines, radial basis function networks, ensemble learning, classification vs regression, dimensionality reduction, evolutionary computation, sampling, and Bayesian networks. 3. The long answer questions require explaining concepts like linear regression, multi-layer perceptrons, support vector machines, classification and regression trees, K-means clustering, principal component analysis, reinforcement learning, hidden Markov models, genetic algorithms, and decision trees.

Uploaded by

akexample
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/ 2

Itilfilflttililtlllltffiffitillt Reg. No.

Question Paper Code : 47118


M.E.A{.Tech. DEGREE EXAL{INATION, JANUARY 2018
First Semester
Computer Science and Engineering
CP 5191 _ MACHINE LEARMNG TECHNIQUES
(Common to M.E. Computer Science and Engineering With Specialization in
Networks))
(Regulations 2017)

Time: Three Hours Maximum : 100 Marks


vIf.,w. recei'ltquestion paper. com

AnswerALL questions

PART _A {10x2=20 Marks)

1. List out the types of machine learning.

2. Define perceptron.

3. What is a spline ?
4. State the applications of radial basis function network.

5. Write the concept behind ensemble learning.

6. Distinguish between classification and regression.

7. What is d.imensionality reduction ? -^ut'd-


oosfl
8. Define evolutionary computation.
.e$\s$eg"
9. What is sampling ? .*or*lo
10. Define Bayesian network.
47L18 Itiltilililtffi]ililililililil]

PART-B (5x19=65Marks)
11. a)
.Describe
tn" ,"rrr,;l;es and issues in machine learning.

b) Discuss linear regression with an example. \rll'Jw'recentquestion paper.com

L2. a) Explain multi-layer perceptron model with a neat diagram.


(oR)
b) Describe the working behaviour of support vector machine with diagrams.
13. a) Elaborate on Classifi.cation and Regression Trees (CART) with examples.
(oR)
b) Summaruze K-means algorithm and group the points (1, 0, 1), (1, 1, 0), (0, 0, 1)
and (1, 1, 1) using K-means algorithm.

L4. a) Describe how principal component analysis is camied out to reduce


dimensionality of data sets.
(oR)
b) i) Write short notes on reinforcement learning. (5)
ii) What is meant by isomap ? Give its significance in machine learning. (8)

15. a) Discuss Markov Chain Monte Carlo Methods in detail.


(oR)
b) Explain hidden Markov models in detail.

PART-C (1x15=15Marks)
16. a) Choose two destination with different routes connecting them. Apply genetic
algorithm to find the optional path based on distance.
(oR)
b) Use decision tree to classify the students in a class based on their academic
performance.
-
.;$,
-F'.-.
.d.to*
.,onlu"
$\\'

You might also like