Unit 2: Classification - Practice Quiz

INT394 — Machine Learning Algorithms 50 Questions
0 Correct 0 Wrong 50 Left
0/50

1 In the context of supervised learning, what is the primary goal of Classification?

A. To map input variables to discrete output categories or classes.
B. To group similar data points together without predefined labels.
C. To predict a continuous numerical value based on input features.
D. To reduce the dimensionality of the dataset.

2 What does a Decision Boundary represent in a classification problem?

A. The limit of the computational power required to train the model.
B. The maximum error rate acceptable for the model.
C. The boundary where the training data ends and the testing data begins.
D. A hypersurface that partitions the underlying vector space into two or more sets, one for each class.

3 Consider a linear classifier in a 2-dimensional feature space defined by . What geometric shape is the decision boundary?

A. A circle
B. A parabola
C. A hyperbola
D. A straight line

4 For a Linear Classifier, the decision rule is often given by . What is the role of the bias term ?

A. It translates the decision boundary away from the origin.
B. It rotates the decision boundary around the origin.
C. It creates non-linear curves in the boundary.
D. It scales the length of the weight vector .

5 In the One-vs-All (One-vs-Rest) strategy for multi-class classification with classes, how many binary classifiers are trained?

A.
B.
C.
D.

6 In the One-vs-One strategy for multi-class classification with classes, how many binary classifiers are trained?

A.
B.
C.
D.

7 When using the One-vs-One strategy, how is the final classification decision typically made for a new data point?

A. By selecting the class with the highest probability from a single classifier.
B. By a voting scheme where the class with the most 'wins' is selected.
C. By choosing the class that was trained last.
D. By averaging the regression outputs of all classifiers.

8 Which of the following is a potential disadvantage of the One-vs-All strategy when classes are imbalanced?

A. It is computationally more expensive than One-vs-One during inference.
B. It cannot handle linear decision boundaries.
C. It requires too many classifiers to be trained.
D. The datasets for the binary classifiers become heavily skewed (e.g., 1 vs 99 others).

9 In Bayes Theorem, given by , what is the term called?

A. Likelihood
B. Prior
C. Posterior
D. Evidence

10 In Bayes Theorem, , what does represent?

A. The probability of the class after observing the data (Posterior).
B. The probability of the class before observing any data (Prior).
C. The conditional dependence of on .
D. The probability of the data occurring regardless of the class.

11 What is the fundamental assumption of the Naïve Bayes classifier?

A. The prior probabilities of all classes are equal.
B. Features are conditionally independent given the class label.
C. Features are dependent on each other given the class label.
D. All features contribute equally to the decision boundary regardless of the class.

12 Which of the following equations represents the decision rule for a Naïve Bayes classifier (ignoring the evidence as it is constant for all classes)?

A.
B.
C.
D.

13 In a Naïve Bayes classifier, what is the Zero Frequency Problem?

A. When the computation results in a divide-by-zero error during normalization.
B. When the prior probability of a class is zero.
C. When a feature value appears in the test set but was never observed with a specific class in the training set, resulting in a zero likelihood.
D. When the entire dataset has zero variance.

14 What technique is commonly used to solve the Zero Frequency Problem in Naïve Bayes?

A. Feature Scaling
B. Gradient Descent
C. Pruning
D. Laplace Smoothing (Additive Smoothing)

15 Which variation of Naïve Bayes is most appropriate when feature values are continuous and assumed to follow a normal distribution?

A. Bernoulli Naïve Bayes
B. Poisson Naïve Bayes
C. Multinomial Naïve Bayes
D. Gaussian Naïve Bayes

16 In Bayesian Decision Theory, the concept of Risk is defined as:

A. The expected loss associated with a decision rule.
B. The inverse of the likelihood function.
C. The probability of choosing the wrong class.
D. The computational complexity of the algorithm.

17 If we use the Zero-One Loss function (loss is 0 for correct classification, 1 for incorrect), minimizing the Risk is equivalent to:

A. Minimizing the squared error.
B. Minimizing the probability of error.
C. Maximizing the likelihood.
D. Maximizing the entropy.

18 Given the formula for Gaussian Naïve Bayes likelihood: , what parameters need to be estimated from the training data?

A. The weights and bias .
B. The mean and variance for each class and feature.
C. The median and mode.
D. The min and max values of .

19 Why is the Naïve Bayes classifier considered a Generative Model?

A. Because it directly learns the decision boundary without modeling densities.
B. Because it models the joint probability (via ) and captures how the data is generated.
C. Because it generates new training data to balance classes.
D. Because it uses genetic algorithms for optimization.

20 In the context of multi-class classification, if the decision regions are separated by linear boundaries, the classifier is known as:

A. A Linear Classifier
B. A Decision Tree
C. A Non-parametric Classifier
D. A Quadratic Classifier

21 Which version of Naïve Bayes is best suited for binary feature vectors (e.g., word presence/absence in text classification)?

A. Linear Naïve Bayes
B. Multinomial Naïve Bayes
C. Bernoulli Naïve Bayes
D. Gaussian Naïve Bayes

22 What is MAP estimation in the context of Bayesian classification?

A. Minimum Absolute Posteriori
B. Mean Average Probability
C. Maximum A Posteriori
D. Maximum Average Precision

23 How does Maximum Likelihood (ML) estimation differ from MAP estimation?

A. There is no difference; they are identical.
B. MAP assumes a uniform likelihood, ML calculates likelihood.
C. ML is for regression, MAP is for classification.
D. ML assumes a uniform prior (or ignores the prior), while MAP accounts for the prior .

24 What is the computational complexity of predicting a class for a single instance using Naïve Bayes with features and classes?

A.
B.
C.
D.

25 In Bayesian Decision Theory, typically denotes:

A. The loss incurred by taking action when the true state of nature is .
B. The probability of class .
C. The likelihood of feature .
D. The learning rate.

26 Which of the following is true regarding the Decision Boundary of a Gaussian Naïve Bayes classifier if all classes share the same covariance matrix?

A. The boundary is circular.
B. The boundary is linear.
C. There is no decision boundary.
D. The boundary is quadratic.

27 Why do we often work with Log-Probabilities (sums of logs) instead of direct probabilities (products) in Naïve Bayes?

A. Because logs are always positive.
B. Because log probabilities are required by the Bayes theorem definition.
C. To make the math harder.
D. To prevent numerical underflow when multiplying many small probabilities.

28 Which of the following text classification scenarios is Multinomial Naïve Bayes typically used for?

A. When features represent the presence/absence of words (binary).
B. When features are continuous word embeddings.
C. When features represent word counts or term frequencies.
D. When the text length is infinite.

29 A classifier that distinguishes between 'Spam' and 'Not Spam' is an example of:

A. Reinforcement Learning
B. Regression
C. Binary Classification
D. Clustering

30 In the formulation , if and , which side of the boundary does the point fall on?

A. Undefined
B. Negative side ()
C. On the boundary ()
D. Positive side ()

31 In Bayesian Decision Theory, the Evidence acts as a:

A. Weighting factor for the likelihood.
B. Normalization constant to ensure probabilities sum to 1.
C. Loss function.
D. Prior belief about the feature distribution.

32 Which of the following statements about Decision Regions is correct?

A. The union of all decision regions must cover the entire feature space.
B. Decision regions are only defined for training data.
C. Decision regions can never be disjoint.
D. Decision regions must always be convex.

33 The One-vs-One strategy generally requires more space to store models than One-vs-All ( vs ). Why might it still be preferred?

A. It is the only method that supports Neural Networks.
B. Each individual classifier is trained on a smaller subset of data (only two classes), potentially making training faster.
C. It guarantees 100% accuracy.
D. It does not require labels.

34 In a probabilistic classifier, if and , and the loss for misclassifying class 1 is much higher than misclassifying class 2, Bayesian Decision Theory might suggest:

A. Choosing class 2 if the expected risk is lower, even if the probability is lower.
B. Choosing class 1 regardless of cost.
C. Choosing the class with the highest probability always.
D. Refusing to classify.

35 What is the vector in a linear classifier geometrically orthogonal to?

A. The x-axis.
B. The data points.
C. The y-axis.
D. The decision boundary (hyperplane).

36 Which term calculates ?

A. Laplace Smoothed Multinomial Likelihood
B. Gaussian Likelihood
C. Gini Impurity
D. Posterior Probability

37 Why does the Naïve Bayes independence assumption often work well in practice even when features are somewhat dependent?

A. Because dependencies cancel each other out.
B. Because real-world data is always independent.
C. Because classification relies on the correct sign/ranking of the posterior, not the exact probability value.
D. Because the algorithm corrects the dependencies during training.

38 If a classifier produces a probability , it is known as a:

A. Regressive Classifier
B. Deterministic Classifier
C. Hard Classifier
D. Soft (Probabilistic) Classifier

39 In the context of Bayes Theorem, if the Prior is uniform for all classes, the MAP estimate is equivalent to maximizing:

A. The Likelihood
B. The Variance
C. The Evidence
D. The Loss Function

40 What is the dimension of the decision boundary for a binary classification problem with 10 input features?

A. 2
B. 9
C. 10
D. 1

41 Which of the following is NOT a property of a Linear Classifier?

A. Simple to interpret (weights indicate feature importance).
B. Computationally efficient (fast inference).
C. Less prone to overfitting compared to high-degree polynomial classifiers.
D. Can learn complex XOR relationships directly without feature engineering.

42 When applying Naïve Bayes, how is the Prior usually estimated from training data?

A. Correlation coefficient of class .
B. Fraction of training samples belonging to class .
C. It is always set to 0.5.
D. Average value of features for class .

43 Which statement best describes the Bayes Error Rate?

A. The rate at which the algorithm converges.
B. The error rate when is ignored.
C. The error rate of a Naïve Bayes classifier.
D. The lowest possible error rate for any classifier on a given distribution.

44 In a 3-class problem using One-vs-Rest, if the outputs of the three classifiers for a point are , , , which class is predicted?

A. Class 3
B. Class 2
C. None
D. Class 1

45 If features and are duplicates (), how does this affect Naïve Bayes?

A. It has no effect.
B. It violates the independence assumption and 'double counts' the importance of that feature.
C. It improves accuracy by reinforcing the signal.
D. It causes a division by zero.

46 What is a Reject Option in classification?

A. Deleting features that are not useful.
B. Rejecting the null hypothesis.
C. Refraining from making a prediction if the posterior probability is below a certain threshold.
D. Removing outliers from the training set.

47 Geometrically, what does the likelihood in a Gaussian Naïve Bayes represent?

A. The volume of the dataset.
B. The density of the data point within the cluster of class .
C. The distance of from the decision boundary.
D. The probability of the class .

48 Which of the following is an example of a Discriminative approach to classification?

A. Hidden Markov Models
B. Logistic Regression
C. Gaussian Mixture Models
D. Naïve Bayes

49 In the context of the One-vs-One strategy, if there is a tie in the voting (e.g., class A and class B both get same number of votes), how is it typically resolved?

A. Random selection or based on highest aggregate confidence score.
B. Both classes are returned.
C. The process is restarted.
D. The model crashes.

50 What happens to the decision boundary in a Linear Classifier if we multiply all weights and bias by a positive constant ?

A. The boundary becomes non-linear.
B. The boundary rotates.
C. The boundary remains unchanged.
D. The boundary shifts.