Module Questions
Q1. What is Machine Learning?. Explain how supervised learning is different from unsupervised learning.
Q2. What are Key development steps of Machine learning applications?
Q3. What are applications of Machine learning?
1 Q4. Describe in brief training error and generalization error.
Q5. Define terms Training Set, Test set, overfitting, underfitting, variance, bais.
Q.6 Explain bias variance tradeoff.
Q7. Write short note on issues in ML.
[Link] the following set of training examples. a. What is the entropy of this collection of training examples with respect
to the target function classification? b. What is the information gain of A2 relative to these training examples?
Q2. Explain the following with examples: a. Decision Tree, b. Decision Tree Learning c. Decision Tree Representation
Q3. What are the performance metrics for classification and regression? Explain it in detail ?
Q4. Write short note on CART.
Q5. The Data in the following table relate grams of plant dry weight. Y to present soil organic matter,x1 and kilogram of
supplemented soil nitrogen added per 1000 square meter,x2. Obtain the multiple regression equation.
2
Q6. Predict the value of Y for subject 6 from the given dataset that contains values for X1, X2, and Y by using a Multiple
Regression Model.
Subject Y X1 X2
1 -3.7 3 8
2 3.5 4 5
3 2.5 5 7
4 11.5 6 3
5 5.7 2 1
2 6 ? 3 2
Q 7. Explain Gini Index with example
Q8.
Q8. Differentiate between linear and Logistic regression
Q9.
[Link] concept of Ensemble Learning and describe Stumping Ensambles.
Q2. Explain K-fold cross validation
Q3. Describe Random forest Algorithm
3 Q4. Differentiate Bagging and Boosting.
Q5. write a short note on XGBoost.
Q6 What are different ways to combine Classifiers?
Q2. Explain K-fold cross validation
Q3. Describe Random forest Algorithm
3 Q4. Differentiate Bagging and Boosting.
Q5. write a short note on XGBoost.
Q6 What are different ways to combine Classifiers?
Q1. What is SVM? Explain the following terms : separating hyperplane, margin, and support vectors with suitable examples .
Q2. Explain how margin is computed and optimal hyperplane is decided
Q3. What are different types of SVM kernels?
Q4. write short notes on (any one)
i) Support vector regression
4 ii) Multiclass classification
iii)SVM Kernel Trick
Q5. Explain SVM is constrained optimization problem
Q6. Explain Quadratic Programming with problem formulation and Equality constraints.
Q1. Q.1 Use the k-means clustering algorithm and Euclidean distance to cluster the following eight 8 examples into Three
clusters: A1 = (2, l0), A2= (2, 5) ,A3= (8. 4), A4= (5, 8), A5= (7, 5), A6= (5. 4), A7= 1( I , 2 ). A8= (4, 9). Find the new
centroid at every new point entry into the cluster groups. Assume initial cluster centers as A l, A4 and A7.
Q2. The table shows the six data points using all link methods (single linkage, complete linkage and average linkage ) to find
clusters. use Euclidean distance measure.
| P| A | B | C | D | E | F |
|A | 0 | 2 | 6 | 10 | 9 | 7 |
| B| 2 | 0 | 5 | 9 | 8 | 6 |
5
| C| 6 | 5 | 0 | 4 | 5 | 3 |
| D| 10 | 9 | 4 | 0 | 3 | 7 |
| E| 9 | 8 | 5 | 3 | 0 | 4 |
| F| 7 | 6 | 3 | 7 | 4 | 0 |
Q3. Explain different methods of graph based clustering.
Q.4 Write short note on DBSCAN
Q5. Explain Expectation Maximization algorithm for clustering
Q6. Explain clustering with minimal spanning trees.
Q1. Why is dimensionality reduction a very important step in ML?
Q2. Explain dimensionality reduction technique in ML.
Q3. Use Principle Component Analysis (PCA) to arrive at the transformed matrix for the given matrix A.
2 1 0 -1
A'=
4 3 1 0.5
Q4. Apply PCA on the following data and find the principle component
X(2.5,0.5,2.2,1.9,3.1,2.3,2,1,1.5,1.1) , Y(2.4,0.7,2.9,2.2,3,2.7,1.6,1.1,1.6,0.9)
6 Q5. Compute Linear Discriminant projection for the following 2d data set
X1=(x1,x2)={(4,1), (2,4), (2,3), (3,6), (4,4)}
X2=(x1,x2)={(9,10), (6,8), (9,5), (8,7), (10,8)}
Q6. Find SVD for
2 2
A=
-1 1
