Top 350+ Solved Machine Learning (ML) MCQ Questions Answer
Q. In Apriori algorithm, if 1 item-sets are 100, then the number of candidate 2 item-sets are
a. 100
b. 200
c. 4950
d. 5000
Q. Machine learning techniques differ from statistical techniques in that machine learning methods
a. are better able to deal with missing and noisy data
b. typically assume an underlying distribution for the data
c. have trouble with large-sized datasets
d. are not able to explain their behavior
Q. What is the final resultant cluster size in Divisive algorithm, which is one of the hierarchical clustering approaches?
a. zero
b. three
c. singleton
d. two
Q. Given a frequent itemset L, If |L| = k, then there are
a. 2k – 1 candidate association rules
b. 2k candidate association rules
c. 2k – 2 candidate association rules
d. 2k -2 candidate association rules
Q. Which Statement is not true statement.
a. k-means clustering is a linear clustering algorithm.
b. k-means clustering aims to partition n observations into k clusters
c. k-nearest neighbor is same as k-means
d. k-means is sensitive to outlier
Q. What is Decision Tree?
a. flow-chart
b. structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label
c. flow-chart like structure in which internal node represents test on an attribute, each branch represents outcome of test and each leaf node represents class label
d. none of the above
Q. What are two steps of tree pruning work?
a. pessimistic pruning and optimistic pruning
b. postpruning and prepruning
c. cost complexity pruning and time complexity pruning
d. none of the options
Q. Which of the following option is true about k-NN algorithm?
a. it can be used for classification
b. ??it can be used for regression
c. ??it can be used in both classification and regression??
d. not useful in ml algorithm
Q. How to select best hyperparameters in tree based models?
a. measure performance over training data
b. measure performance over validation data
c. both of these
d. random selection of hyper parameters