Professional Documents
Culture Documents
Basic Ml questions:
Q.Define
1.hypothesis and hypothesis space
2.feature space\feature matrix
3.information gain
4.gini index
5.entropy.How does this change with positive and negative data values of a feature
6.Sigmoid curve
7.soft and hard margin in SVM
8.hyperplane
9.response vector
10.pre pruning
11.post pruning
12.overfitting
13.Conditional probability.
Q.Distinguish between
a.supervised and unsupervised machine learning
b.classification and regression
c.one v/s all and one v/s one multiclass classification
d.linear and logistic regression
e.machine learning and traditional programming
f.linear and non linear separable data.
Q. What are the elements of reinforcement learning?
Q.What is the goal of the support vector machine (SVM)? How to compute the margin
Q.Use decision tree to classify students based on their academic records.Explain with
example.
Q.Suppose that we want to build a neural network that classifies two dimensional data (i.e., X
= [x1, x2]) into two classes: diamonds and crosses. We have a set of training data that is
plotted as follows:
Draw a network that can solve this classification problem. Justify your choice of the number
of nodes and the architecture. Draw the decision boundary that your network can find on the
diagram.
Q.What is kernel trick in SVM.Explain with the help of example.Also explain the types of
kernel.
Q.Why SVM is efficient than logistic regression for classification?
Q.How will you apply SVM to detect credit card fraud?
Write the formula for information gain for an attribute.Compute information gain for
all attributes.Which is selected as the root node?
Q.How are entropy and information gain related vis-a-vis decision trees?
Q.How do you calculate the entropy of children nodes after the split based on on a feature?
Q.Explain overfitting problem in decision trees.
Q.What is the stopping criteria in decision tress?
Q.What is a decision tree ? How a decision tree is constructed explain with example.