DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

MACHINE LEARNING QUIZ – I

SET – I

1. Learning from unlabelled data is called [ ]

a. Supervised learning
b. Unsupervised learning
c. Reinforcement learning
d. None of the above
2. The following is one of the unsupervised learning under descriptive modeling [ ]
a. Classification
b. Regression
c. Subgroup discovery
d. Association rule discovery
3. The following is an example of grading model [ ]
a. Decision tree
b. Random forest
c. Support vector machines
d. None of the above
4. The term ‘accuracy’ can be defined as [ ]
a. Correctly classified instances / total number of instances
b. Incorrectly classified instances / total number of instances
c. Correctly classified instances / incorrectly classified instances
d.. Incorrectly classified instances / correctly classified instances
5. In regression, the target variable is to be predicted as [ ]
a. Nominal type
b. Continuous type
c. Ordinal type
d. None of the above
6. The task of grouping data without prior information on the group is called [ ]
a. Classification
b. Regression
c. Clustering
d. Association analysis
7. Incorrectly classified positives are called as [ ]
a. True positives
b. True negatives
c. False positives
d. False negatives
8. The good performance of the classifier is [ ]
a. High accuracy and high error rate
b.. High accuracy and low error rate
c. Low accuracy and low error rate
 d. Low accuracy and high error rate
9. The example of predictive clustering is [ ]
a. K-means
b. Naïve bayes
c. Decision tree
d. None of the above
10. The hypothesis space is [ ]
a. The space of one concept only
b. The space of two concepts only
c.. The space of possible concepts
d. None of the above
11. Which of the following is the notation of internal disjunction [
]
a. Length = 3
b. Length = 4
c. Length = [3, 4]
d. All of the above
12. The version space is [ ]
a. The set of all complete concepts
b. The set of all consistent concepts
c. The set of all complete and consistent concepts
d. The set of neither complete nor consistent concepts
13. A concept covers all positive examples is called [ ]
a. Complete
b. Consistent
c. Robustness
d. None of the above
14. The following is one of the impurity measurements of a node in decision tree
a. Minority class [ ]
b. Entropy
c. Gini Index
d. All of the above
15. The operation of merging all leaves in a subtree is called [ ]
a. Pruning of subtree
b. Merging
c. Splitting
d. None of the above
16. The following function is not sensitive to the fluctuations in the class distribution [ ]
a. Entropy
b. Gini Index
c. √Gini (Square root of Gini)
d. None of the above
17. A complete feature tree using the rules as features is called [ ]
a. Feature tree
b. Decision tree
c. Rule tree
 d. None of the above
18. Which of the following is correct for the notation of the first order logic [ ]
a. Rules are written back-to-front in ‘head-if-body’ fashion
b. Variables start with a capital letter
c. Variables are implicitly universally quantified
d. All of the above
19. The rue learning algorithms remove examples covered by the rule list learned from
consideration and proceed with the remaining examples. This strategy is called [ ]
a. Top down approach
b. Backtracking
c. Separate-and-Conquer
d. None of the above
20. A model consisting of an ordered sequence of rules is called [ ]
a. Rule list
b. Rule set
c. Subgroup
d. None of the above