Machine Learning QB
Machine Learning QB
84. Explain, in brief, the decision tree algorithm, node and leaf in decision tree.
85. What is entropy of a decision tree? Explain information gain in a decision
tree.
86. Explain the kNN model in detail. Discuss the error rate and validation error
in the kNN algorithm. Explain how to calculate the distance between the test data
and the training data for kNN.
87. Explain prior probability, posterior probability and likelihood probability with
an example.
88. Explain Naïve Bayes classifier? Why is it named so? What is optimal Bayes
classifier?
89. Explain with examples how unsupervised learning is different from
supervised learning?
106. Explain Naïve Bayes classifier.
118. What is entropy? Why is it used in Machine learning algorithm?
126. Consider the training dataset given in Table below. Use k-NN with 3 nearest
neighbours, to predict whether the student obtaining 6.1 in CGPA, 40 in
Assessment, 5 in Project submitted; will pass or fail.
129. For the following set of training samples, find which attribute can be chosen
as the root for decision tree classification.