Home / Study library / Machine Learning Techniques / Quiz 2 · Sep 2023 Machine Learning Techniques · Quiz 2 · Sep 2023
Machine Learning Techniques · Quiz 2 · Sep 2023
← Course papers · Start practice / exam
Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 14 published solutions
Q179 Q180 Q181 Q182 Q183 Q184 Q185 Q186 Q187 Q188 Q189 Q190 Q191 Q192
Question 179 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q179
Question 180 MSQ · 4.0 marks A. The kernel regression is parametric
B. The kernel regression is non-parametric
C. The Kernel matrix K is positive semi-definite
D. In general, Kernel regression is computationally expensive than a simple linear
regression
A published solution is not available for this question yet.
Report a correction for Q180
Question 181 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q181
Question 182 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q182
Question 183 MSQ · 4.0 marks Which of the following is/are the primary advantages of using L1 regularization
A. L1 regularization reduces the risk of overfitting.
B. L1 regularization tends to produce sparse models.
C. L1 regularization always improves the model’s predictive accuracy on large
datasets.
D. L1 regularization is primarily used to increase model complexity.
A published solution is not available for this question yet.
Report a correction for Q183
Question 184 MSQ · 4.0 marks Select all the statements that are true about decision trees and k-Nearest Neighbors (k-NN) in
machine learning:
A. Decision trees are a supervised learning algorithm used for classifications.
B. The k-NN algorithm is a lazy learner, which means it doesn’t build an explicit
model during the training phase.
C. In k-NN, the value of k represents the number of features used for
classification.
D. k-Nearest Neighbors (k-NN) is a parametric model that requires estimating
probability distributions.
E. The depth of the tree is a hyperparameter and is typically chosen using cross-
validation.
A published solution is not available for this question yet.
Report a correction for Q184
Question 185 MCQ · 4.0 marks A. **w**1 → Lasso regression, **w**2 → Linear regression, **w**3 → Ridge regression
B. **w**1→ Ridge regression, **w**2 → Lasso regression, **w**3 → Linear regression
C. **w**1 → Linear regression, **w**2 → Ridge regression, **w**3 → Lasso regression
D. **w**1 → Ridge regression, **w**2 → Linear regression, **w**3 → Lasso regression
A published solution is not available for this question yet.
Report a correction for Q185
Question 186 MCQ · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q186
Question 187 NAT · 4.0 marks You are working on a decision tree algorithm to classify whether a bank loan applicant will default
on their loan based on several financial factors. The dataset includes Credit Score, Annual Income,
Loan Amount, Loan Term as features.
The target variable is binary: 1 for ”Default” and 0 for ”No Default.”
You have a dataset of 500 loan applicants, and you want to construct a decision tree to predict
loan default. To determine the first split (root node), you'll use the information gain as the
criterion. Here’s the distribution of loan default in the dataset:
Default: 150 applicants No Default: 350 applicants
Calculate the Entropy for the initial dataset.
A published solution is not available for this question yet.
Report a correction for Q187
Question 188 NAT · 4.0 marks A published solution is not available for this question yet.
Report a correction for Q188
Question 189 NAT · 2.0 marks Given a training dataset with 100 data points, how many distances would we have to compute in
the process of predicting the label of test-point in the k-NN algorithm with k = 5
A published solution is not available for this question yet.
Report a correction for Q189
Question 190 NAT · 2.0 marks If the proportion of points belonging to class 1 in a node is p, for what value of p is the node’s
entropy maximum?
A published solution is not available for this question yet.
Report a correction for Q190
Question 191 NAT · 3.0 marks A published solution is not available for this question yet.
Report a correction for Q191
Question 192 NAT · 3.0 marks What will be the predicted label according to the Naive Bayes decision rule?
A published solution is not available for this question yet.
Report a correction for Q192