0% found this document useful (0 votes)
55 views

21AI63 Simp 23

Copy of 21AI63 simp 23
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)
55 views

21AI63 Simp 23

Copy of 21AI63 simp 23
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/ 3

Machine Learning(AIML)-SIMP-21AI63 SIMP

By the TIE review team

Module 1-5 SIMP

1. Define ML, explain its importance,application and its types with practical
examples wherever required-12M
2. Briefly explain the issues and perspectives in ML
3. Briefly explain about the process of designing a learning system? Explain with
examples
4. Explain the well posed learning problems with examples
5. Define Concept learning, mention the task and explain how CL can be
viewed as the task of searching
6. Explain (i)unsupervised learning model (ii)ILH (iii)Consistent Hypothesis
(iv)Version Space (v)General and specific boundary (vi)Checkers learning
system -2M each
7. Demonstrate Candidate elimination and Find S for the following dataset

8.
How do you classify images using MNIST datasets,Explain
9. With code snippets explain the following
(i)Multilabel v/s Multiclass v/s Multioutput classification (ii) Confusion
matrix (iii)Precision and recall (iv)Cross validation

10.Explain gradient descent algorithm and discuss its various types 11.Determine
the error analysis on a multiclass classification with an example 12.How do you
constain weights in RLM(regularized linear models),explain 13.Explain polynomial
Kernel Gaussian and RBF kernel with code snippet 14.How do you train an ML
model, explain by taking Linear regression as the governing entity
15.Show how SVM’s make predictions using Quadratic programming and
Kernelized SVM
16.Write a short note on (i)Decision Trees and how they are used to make
predictions (ii)CART Training Algorithm
17. Determine the concepts of (i)Bagging and pasting (ii)Voting classifiers (wrt
ensemble methods
18.Explain the following boosting methods with code snippets (i)Adaboost
(ii)Gradient boosting
19.How do you create,train and visualize the decision tree,explain with code
snippet
20.Explain the concept of stacking in context to ensemble methods 21.Write bayes
theorem, identify the relationship between bayes theorem and problem of concept
learning
22.Show how Maximum likelihood hypothesis is helpful for predicting
probabilities derive the expression that can be called as cross entropy
23.Write a short note on MDL
24.Examine EM algorithm for estimating two means to obtain the expression for
maximum likelihood hypothesis and K means
25.Construct Naive bayes classifier with an example
26.Illustrate the brute-force MAP Learning algorithm by deriving the equations for
posterior probability
27.Illustrate the relationship between maximum likelihood and Least Squared
Error hypothesis by deriving the mathematical equations

You might also like