1What is the main goal of a classification algorithm?
Introduction to classification algorithms
Easy
A.Calculate the average of all values
B.Compress data into smaller files
C.Assign data to predefined categories
D.Arrange data in chronological order
Correct Answer: Assign data to predefined categories
Explanation:
Classification algorithms predict which predefined category or class an observation belongs to.
Incorrect! Try again.
2Which type of variable does a classification model usually predict?
Introduction to classification algorithms
Easy
A.A categorical target variable
B.A database identifier variable
C.A random indexing variable
D.A continuous measurement variable
Correct Answer: A categorical target variable
Explanation:
Classification predicts categorical labels such as spam or not spam.
Incorrect! Try again.
3Which task is an example of binary classification?
Introduction to classification algorithms
Easy
A.Predicting whether an email is spam
B.Grouping customers without known labels
C.Calculating the mean monthly income
D.Predicting a person's exact height
Correct Answer: Predicting whether an email is spam
Explanation:
Binary classification selects between two classes, such as spam and not spam.
Incorrect! Try again.
4In supervised classification, what does the training dataset contain?
Introduction to classification algorithms
Easy
A.Input features and known class labels
B.Random values without any structure
C.Only input features without labels
D.Only class labels without features
Correct Answer: Input features and known class labels
Explanation:
A supervised model learns from examples that include both features and their correct labels.
Incorrect! Try again.
5What is multiclass classification?
Introduction to classification algorithms
Easy
A.Regression involving several numeric outputs
B.Classification using more than two datasets
C.Classification involving more than two classes
D.Clustering involving exactly two groups
Correct Answer: Classification involving more than two classes
Explanation:
Multiclass classification chooses among three or more possible class labels.
Incorrect! Try again.
6What does the letter represent in KNN?
KNN (k-nearest neighbors) algorithm
Easy
A.The number of dataset columns
B.The number of neighbors considered
C.The number of target classes
D.The number of training rounds
Correct Answer: The number of neighbors considered
Explanation:
In KNN, specifies how many nearby training observations are used for prediction.
Incorrect! Try again.
7How does KNN commonly assign a class to a new observation?
KNN (k-nearest neighbors) algorithm
Easy
A.By selecting the least frequent class
B.By taking a vote among nearby neighbors
C.By choosing a class at random
D.By averaging all target class names
Correct Answer: By taking a vote among nearby neighbors
Explanation:
KNN usually assigns the class that appears most often among the nearest neighbors.
Incorrect! Try again.
8Which measure is commonly used by KNN to identify nearby observations?
KNN (k-nearest neighbors) algorithm
Easy
A.Cross-validation score
B.Classification accuracy
C.Euclidean distance
D.Correlation coefficient
Correct Answer: Euclidean distance
Explanation:
Euclidean distance is a common measure of how close two observations are in feature space.
Incorrect! Try again.
9Why is feature scaling often useful before applying KNN?
KNN (k-nearest neighbors) algorithm
Easy
A.It converts classification into regression
B.It automatically creates additional class labels
C.It removes the need to choose
D.It prevents large-scale features from dominating distance
Correct Answer: It prevents large-scale features from dominating distance
Explanation:
Scaling puts features on comparable ranges so one feature does not unfairly dominate distance calculations.
Incorrect! Try again.
10What does KNN need to retain when making predictions?
KNN (k-nearest neighbors) algorithm
Easy
A.The stored training observations
B.Only the final accuracy score
C.The folds from cross-validation
D.Only the names of the features
Correct Answer: The stored training observations
Explanation:
KNN compares new observations with stored training examples when making predictions.
Incorrect! Try again.
11Naïve Bayes is based on which mathematical theorem?
Naïve Bayes algorithm
Easy
A.The central limit theorem
B.Pythagoras' theorem
C.Bayes' theorem
D.Taylor's theorem
Correct Answer: Bayes' theorem
Explanation:
Naïve Bayes uses Bayes' theorem to calculate class probabilities from observed features.
Incorrect! Try again.
12What simplifying assumption does Naïve Bayes make about features?
Naïve Bayes algorithm
Easy
A.Features must be arranged alphabetically
B.Features must always have identical values
C.Features are conditionally independent given the class
D.Features are unrelated to every class
Correct Answer: Features are conditionally independent given the class
Explanation:
Naïve Bayes assumes that features are conditionally independent when the class is known.
Incorrect! Try again.
13Which application commonly uses Naïve Bayes?
Naïve Bayes algorithm
Easy
A.Database table sorting
B.Email spam classification
C.Image file compression
D.Screen brightness adjustment
Correct Answer: Email spam classification
Explanation:
Naïve Bayes is commonly used for text tasks such as identifying spam emails.
Incorrect! Try again.
14How does Naïve Bayes usually select a predicted class?
Naïve Bayes algorithm
Easy
A.It chooses the class with the lowest prior probability
B.It chooses the class with the longest label
C.It chooses the class with the fewest features
D.It chooses the class with the highest posterior probability
Correct Answer: It chooses the class with the highest posterior probability
Explanation:
The predicted label is usually the class with the greatest posterior probability.
Incorrect! Try again.
15What is a prior probability in Naïve Bayes?
Naïve Bayes algorithm
Easy
A.The probability of a class before observing features
B.The distance between two neighboring observations
C.The fraction of predictions that are incorrect
D.The number of folds used during validation
Correct Answer: The probability of a class before observing features
Explanation:
A prior represents the probability of a class before the model considers the observed feature values.
Incorrect! Try again.
16What is the main purpose of cross-validation?
Cross-validation and metrics
Easy
A.To remove every incorrect prediction
B.To increase the number of target classes
C.To estimate performance on unseen data
D.To replace all training observations
Correct Answer: To estimate performance on unseen data
Explanation:
Cross-validation evaluates how well a model is likely to generalize to new data.
Incorrect! Try again.
17In -fold cross-validation, how many subsets is the dataset divided into?
Cross-validation and metrics
Easy
A. subsets
B. subsets
C. subsets
D. subsets
Correct Answer: subsets
Explanation:
The dataset is divided into folds, and each fold is used for validation once.
Incorrect! Try again.
18What does classification accuracy measure?
Cross-validation and metrics
Easy
A.The number of features used by the model
B.The time required to collect the data
C.The proportion of predictions that are correct
D.The distance between training observations
Correct Answer: The proportion of predictions that are correct
Explanation:
Accuracy is the number of correct predictions divided by the total number of predictions.
Incorrect! Try again.
19What information does a confusion matrix summarize?
Cross-validation and metrics
Easy
A.Distances compared across neighboring points
B.Training times compared across computers
C.Predicted classes compared with actual classes
D.Feature values compared with their averages
Correct Answer: Predicted classes compared with actual classes
Explanation:
A confusion matrix counts correct and incorrect predictions for each class.
Incorrect! Try again.
20What does precision measure in binary classification?
Cross-validation and metrics
Easy
A.The fraction of all predictions that are correct
B.The fraction of predicted positives that are correct
C.The fraction of actual positives that are identified
D.The fraction of actual negatives that are missed
Correct Answer: The fraction of predicted positives that are correct
Explanation:
Precision measures how many observations predicted as positive are truly positive.
Incorrect! Try again.
21A model predicts the probability that a customer will cancel a subscription. If the classification threshold is increased from to , what is the most likely effect?
Introduction to classification algorithms
Medium
A.The model will automatically become more accurate
B.Fewer customers will be classified as likely to cancel
C.Every predicted probability will increase by
D.More customers will be classified as likely to cancel
Correct Answer: Fewer customers will be classified as likely to cancel
Explanation:
A higher threshold requires a larger predicted probability for the positive class, so fewer observations are classified as positive.
Incorrect! Try again.
22Which task is most appropriately treated as a multiclass classification problem?
Introduction to classification algorithms
Medium
A.Predicting whether a transaction is fraudulent
B.Predicting a flower's species from three species
C.Predicting the selling price of a house
D.Predicting the number of website visits
Correct Answer: Predicting a flower's species from three species
Explanation:
Multiclass classification assigns each observation to one of more than two discrete classes.
Incorrect! Try again.
23A classifier performs very well on its training data but poorly on unseen test data. What is the most likely explanation?
Introduction to classification algorithms
Medium
A.The model is overfitting the training data
B.The decision threshold equals
C.The model is underfitting the training data
D.The target variable has been standardized
Correct Answer: The model is overfitting the training data
Explanation:
Overfitting occurs when a model learns training-specific patterns that do not generalize well to unseen data.
Incorrect! Try again.
24A binary classifier outputs for an observation. Using a threshold of , which class is assigned?
Introduction to classification algorithms
Medium
A.Class , because
B.Class , because probabilities are rounded
C.Class , because
D.Class , because
Correct Answer: Class , because
Explanation:
The observation is assigned to class because its predicted probability meets or exceeds the selected threshold.
Incorrect! Try again.
25A KNN classifier uses Euclidean distance on age, measured from to , and annual income, measured from to . What should be done before training?
KNN (k-nearest neighbors) algorithm
Medium
A.Sort all observations by annual income
B.Convert both features into class labels
C.Remove the feature with the smaller range
D.Scale both features to comparable ranges
Correct Answer: Scale both features to comparable ranges
Explanation:
Without scaling, annual income would dominate Euclidean distance because its numerical range is much larger.
Incorrect! Try again.
26For a binary KNN classifier, the five nearest neighbors have labels . What class is predicted using unweighted voting?
KNN (k-nearest neighbors) algorithm
Medium
A.Class , because it has three votes
B.Class , because it appears first
C.Class , because it has two votes
D.Class , because it appears last
Correct Answer: Class , because it has three votes
Explanation:
Unweighted KNN predicts the majority class among the nearest neighbors, and class receives three of five votes.
Incorrect! Try again.
27What is the usual effect of increasing from to a much larger value in a KNN classifier?
KNN (k-nearest neighbors) algorithm
Medium
A.The model stores fewer training observations
B.The boundary becomes smoother with higher bias
C.The distance metric becomes unnecessary
D.The boundary becomes rougher with lower bias
Correct Answer: The boundary becomes smoother with higher bias
Explanation:
A larger averages predictions over more neighbors, producing a smoother boundary while generally increasing bias and reducing variance.
Incorrect! Try again.
28A KNN model gives too much influence to distant neighbors within the selected neighborhood. Which modification best addresses this issue?
KNN (k-nearest neighbors) algorithm
Medium
A.Assign every observation a unique class
B.Weight votes by inverse distance
C.Replace distances with random values
D.Increase every feature by one unit
Correct Answer: Weight votes by inverse distance
Explanation:
Inverse-distance weighting gives closer neighbors greater influence than neighbors located farther from the query point.
Incorrect! Try again.
29Why does KNN often perform poorly when a dataset contains many irrelevant features?
KNN (k-nearest neighbors) algorithm
Medium
A.Class labels become continuous in high dimensions
B.Irrelevant features always create missing values
C.Distances become less informative in high dimensions
D.KNN requires exactly two input features
Correct Answer: Distances become less informative in high dimensions
Explanation:
Irrelevant dimensions can distort neighborhood relationships, making nearby and distant observations harder to distinguish.
Incorrect! Try again.
30The term "naive" in Naive Bayes refers to which modeling assumption?
Naïve Bayes algorithm
Medium
A.Features must follow identical distributions
B.Classes always have equal prior probabilities
C.Predictions must use a threshold of
D.Features are conditionally independent given the class
Correct Answer: Features are conditionally independent given the class
Explanation:
Naive Bayes assumes that features are conditionally independent once the class label is known.
Incorrect! Try again.
31A spam filter has , , and . Before normalization, which value is proportional to ?
Naïve Bayes algorithm
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
Bayes' rule gives an unnormalized posterior proportional to the prior multiplied by the likelihood: .
Incorrect! Try again.
32In a multinomial Naive Bayes text classifier, a word appears in a test document but never appeared in training documents of one class. What prevents the class probability from becoming zero?
Naïve Bayes algorithm
Medium
A.Laplace smoothing of feature counts
B.Standardization of document lengths
C.Removal of all repeated words
D.Conversion of counts into labels
Correct Answer: Laplace smoothing of feature counts
Explanation:
Laplace smoothing adds a small count to each feature-class combination, avoiding zero likelihoods for unseen words.
Incorrect! Try again.
33Which Naive Bayes variant is generally most suitable when features are continuous measurements such as height and weight?
Naïve Bayes algorithm
Medium
A.Bernoulli Naive Bayes
B.Multinomial Naive Bayes
C.Categorical Naive Bayes
D.Gaussian Naive Bayes
Correct Answer: Gaussian Naive Bayes
Explanation:
Gaussian Naive Bayes models each continuous feature using a Gaussian distribution within each class.
Incorrect! Try again.
34Two classes have identical feature likelihoods for a particular observation, but class has a larger prior probability than class . Which prediction will Naive Bayes make?
Naïve Bayes algorithm
Medium
A.A random class, because likelihoods match
B.Class , because its prior is smaller
C.Class , because its posterior is larger
D.Both classes, because classification is multilabel
Correct Answer: Class , because its posterior is larger
Explanation:
With equal likelihoods, the larger prior produces the larger posterior probability, so class is selected.
Incorrect! Try again.
35In -fold cross-validation, how many times is each observation normally used for validation?
Cross-validation and metrics
Medium
A.Five times
B.Once
C.Twice
D.Four times
Correct Answer: Once
Explanation:
Each observation belongs to one validation fold and appears in the training portion of the other four iterations.
Incorrect! Try again.
36A medical screening classifier should avoid missing patients who actually have a condition. Which metric should receive the most attention?
Cross-validation and metrics
Medium
A.Recall for the positive class
B.Specificity for the negative class
C.Precision for the positive class
D.Overall prediction accuracy
Correct Answer: Recall for the positive class
Explanation:
Recall measures the proportion of actual positive cases correctly detected, so maximizing it reduces false negatives.
Incorrect! Try again.
37A classifier produces true positives and false positives. What is its precision?
Cross-validation and metrics
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
Precision is .
Incorrect! Try again.
38A dataset contains negative cases and positive cases. A model predicts every case as negative. Why is its accuracy misleading?
Cross-validation and metrics
Medium
A.It produces too many false-positive cases
B.It requires fewer cross-validation folds
C.It correctly identifies every positive case
D.It fails to identify any positive cases
Correct Answer: It fails to identify any positive cases
Explanation:
The high accuracy comes from class imbalance; the model has zero recall for the positive class.
Incorrect! Try again.
39Why is stratified cross-validation preferred for an imbalanced classification dataset?
Cross-validation and metrics
Medium
A.It guarantees perfect scores on each fold
B.It removes the need for a test set
C.It places all minority cases in one fold
D.It preserves class proportions across folds
Correct Answer: It preserves class proportions across folds
Explanation:
Stratification keeps approximately the same class distribution in every fold, making evaluation more representative.
Incorrect! Try again.
40A classifier has precision and recall . What is its score?
Cross-validation and metrics
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
The score is .
Incorrect! Try again.
41A binary classifier outputs a calibrated posterior probability . A false positive costs 2 units, a false negative costs 8 units, and correct predictions cost 0. Which decision rule minimizes conditional expected cost?
Introduction to classification algorithms
Hard
A.Predict 1 when
B.Predict 1 when
C.Predict 1 when
D.Predict 1 when
Correct Answer: Predict 1 when
Explanation:
Predicting 1 costs , while predicting 0 costs . The first cost is smaller when , giving .
Incorrect! Try again.
42A classifier trained with positive-class prior outputs . At deployment, only the class prior changes to ; the class-conditional feature distributions remain unchanged. What is the adjusted posterior probability?
Introduction to classification algorithms
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
The training posterior odds are . Correcting by the prior-odds ratio gives deployment odds , corresponding to probability .
Incorrect! Try again.
43A classifier's real-valued score is transformed by a strictly increasing nonlinear function. No ties are introduced. Which statement is necessarily true?
Introduction to classification algorithms
Hard
A.Its ROC curve and AUC remain unchanged
B.Its probability calibration remains unchanged
C.Its accuracy at threshold remains unchanged
D.Its log-loss on every observation remains unchanged
Correct Answer: Its ROC curve and AUC remain unchanged
Explanation:
A strictly increasing transformation preserves every pairwise score ranking, so ROC points obtainable by ranking and the AUC are unchanged. Calibration and fixed numerical thresholds need not be preserved.
Incorrect! Try again.
44A multiclass classifier provides calibrated posteriors. A correct prediction costs 0, an incorrect prediction costs 1, and abstaining costs . Let be the largest class posterior. When is abstention strictly optimal?
Introduction to classification algorithms
Hard
A.When
B.When
C.When
D.When
Correct Answer: When
Explanation:
Choosing the most probable class has expected loss . Abstention is better when , which is equivalent to .
Incorrect! Try again.
45Three one-vs-one classifiers produce , , and for the same observation. What follows from these pairwise outcomes alone?
Introduction to classification algorithms
Hard
A.Class is uniquely selected by majority voting
B.No unique class follows without an aggregation rule
C.Class is uniquely selected by score averaging
D.Class is uniquely selected by transitivity
Correct Answer: No unique class follows without an aggregation rule
Explanation:
The outcomes form a Condorcet cycle: each class wins once and loses once. A tie-breaking, coupling, or other aggregation rule is required.
Incorrect! Try again.
46A KNN model uses Euclidean distance with features age in years and annual income in dollars. Income has a far larger numeric range, although both features are equally relevant. What is the most defensible preprocessing step?
KNN (k-nearest neighbors) algorithm
Hard
A.Scale both features using training-fold statistics only
B.One-hot encode both continuous features before fitting
C.Rank-transform labels before calculating neighbor distances
D.Normalize each observation to have unit vector length
Correct Answer: Scale both features using training-fold statistics only
Explanation:
Feature scaling prevents income from dominating Euclidean distance solely because of its units. Estimating scaling parameters within each training fold avoids validation leakage.
Incorrect! Try again.
47Assume every pairwise feature distance is distinct. Which quantity exactly equals the leave-one-out cross-validation error of a 1-NN classifier on a training set?
KNN (k-nearest neighbors) algorithm
Hard
A.The fraction belonging to the training set's minority class
B.The fraction whose nearest other point has the same label
C.The fraction whose nearest other point has a different label
D.The resubstitution error obtained by retaining each point itself
Correct Answer: The fraction whose nearest other point has a different label
Explanation:
After an observation is removed, its 1-NN prediction is the label of its nearest remaining point. Thus, it is misclassified exactly when that neighbor has a different label.
Incorrect! Try again.
48A distance-weighted 3-NN classifier uses weights . The neighbors are class A at distances and , and class B at distance . Which class is predicted?
KNN (k-nearest neighbors) algorithm
Hard
A.Class A because its nearest distance average is smaller
B.A tie because both classes have total weight four
C.Class A because it has two of the three neighbors
D.Class B because its total weight is four rather than three
Correct Answer: Class B because its total weight is four rather than three
Explanation:
Class A receives weight , while class B receives . Weighted KNN therefore predicts class B despite the unweighted majority.
Incorrect! Try again.
49Under standard regularity conditions, which asymptotic choice of supports consistency of KNN as the sample size grows?
KNN (k-nearest neighbors) algorithm
Hard
A. while stays bounded
B. for every
C. while
D. for every
Correct Answer: while
Explanation:
Increasing reduces variance, while keeps the neighborhood asymptotically local. Both conditions are needed for the usual consistency result.
Incorrect! Try again.
50Two observations have independent irrelevant binary coordinates, each distributed as Bernoulli. For squared Euclidean distance over these coordinates, what is the coefficient of variation?
KNN (k-nearest neighbors) algorithm
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
The squared distance is the number of mismatches, distributed as Binomial. Its mean is and standard deviation is , so their ratio is .
Incorrect! Try again.
51In multinomial Naïve Bayes, the prior odds for classes and are . A token occurs three times and has probabilities under and under . All other token contributions cancel. What are the posterior odds?
Naïve Bayes algorithm
Hard
A. in favor of class
B. in favor of class
C. in favor of class
D. in favor of class
Correct Answer: in favor of class
Explanation:
The likelihood ratio is . Multiplying by prior odds gives posterior odds for class .
Incorrect! Try again.
52A Bernoulli Naïve Bayes model has equal class priors. For an observation, and . The probabilities are in class and in class . What is predicted?
Naïve Bayes algorithm
Hard
A.Class because its likelihood is rather than
B.Class because the present feature has probability
C.A tie because the class priors are equal
D.Class because its joint likelihood is
Correct Answer: Class because its likelihood is rather than
Explanation:
Bernoulli Naïve Bayes includes absent features. The likelihoods are for and for .
Incorrect! Try again.
53A one-feature Gaussian Naïve Bayes model has equal priors and class means of 0. Class A has variance 1, and class B has variance 4. For , what does the model predict?
Naïve Bayes algorithm
Hard
A.Class B;
B.A tie;
C.Class A;
D.Neither; the ratio depends on training sample size
Correct Answer: Class A;
Explanation:
At the common mean, a Gaussian density is proportional to . The standard deviations are 1 and 2, so class A's density and posterior are twice class B's.
Incorrect! Try again.
54In multinomial Naïve Bayes, a class contains 20 total token occurrences over a vocabulary of size 100. A particular token is absent from that class. With additive smoothing , what probability is assigned to the token?
Naïve Bayes algorithm
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
Additive smoothing gives . The vocabulary-wide pseudocounts increase the denominator by 100.
Incorrect! Try again.
55An informative binary feature is duplicated exactly and both copies are supplied to Naïve Bayes. Which effect is most accurate?
Naïve Bayes algorithm
Hard
A.Its evidence is counted twice, potentially changing posterior calibration and the predicted class
B.It is merged into one sufficient statistic, preserving all posterior probabilities exactly
C.It changes only class priors, leaving conditional likelihoods and predictions exactly unchanged
D.It is automatically discarded because its empirical probabilities match the original feature
Correct Answer: Its evidence is counted twice, potentially changing posterior calibration and the predicted class
Explanation:
Naïve Bayes treats the copies as conditionally independent evidence. Their duplicated likelihood contributions can produce overconfident posteriors and can alter decisions when other evidence opposes them.
Incorrect! Try again.
56A researcher compares 50 hyperparameter settings and reports the best mean score from the same 10-fold cross-validation used for selection. Which procedure best estimates generalization performance without selection bias?
Cross-validation and metrics
Hard
A.Average only the three highest scores from the original folds
B.Select the setting on all data and report its resubstitution score
C.Increase the same cross-validation run from 10 folds to 20 folds
D.Use inner folds for selection and outer folds for performance estimation
Correct Answer: Use inner folds for selection and outer folds for performance estimation
Explanation:
Nested cross-validation separates model selection from performance estimation. Each outer test fold remains untouched by the hyperparameter search performed in its corresponding inner loop.
Incorrect! Try again.
57A dataset contains multiple measurements from each patient, and the goal is to predict outcomes for entirely unseen patients. Which cross-validation design is appropriate?
Cross-validation and metrics
Hard
A.Assign all measurements from each patient to the same fold
B.Randomly distribute every patient's measurements across all folds
C.Stratify individual measurements while ignoring patient identity
D.Sort measurements by outcome before assigning alternating folds
Correct Answer: Assign all measurements from each patient to the same fold
Explanation:
Group-based splitting prevents measurements from one patient appearing in both training and validation sets. Otherwise, patient-specific information can cause leakage and inflate performance.
Incorrect! Try again.
58A classifier has sensitivity and false-positive rate in a population where prevalence is . Assuming these rates transfer to that population, what is its precision?
Cross-validation and metrics
Hard
A.Approximately
B.Approximately
C.Approximately
D.Approximately
Correct Answer: Approximately
Explanation:
Precision is . Low prevalence makes false positives dominate despite high sensitivity.
Incorrect! Try again.
59A classifier has , , , and . What is its Matthews correlation coefficient?
Cross-validation and metrics
Hard
A.Approximately
B.Approximately
C.Approximately
D.Approximately
Correct Answer: Approximately
Explanation:
The MCC is .
Incorrect! Try again.
60A decision threshold is chosen to maximize F1 using the combined out-of-fold predictions from a cross-validation run. The maximum F1 on those same predictions is then reported. What is the main problem?
Cross-validation and metrics
Hard
A.Out-of-fold probabilities cannot be used to select any classification threshold
B.F1 is invariant to thresholds, so the maximization has no statistical meaning
C.Combining predictions forces every fold to have identical class prevalence
D.Threshold selection reuses evaluation data and makes the reported maximum optimistic
Correct Answer: Threshold selection reuses evaluation data and makes the reported maximum optimistic
Explanation:
The out-of-fold labels influenced threshold selection, so evaluating the selected threshold on them introduces selection bias. Nested cross-validation or an independent test set is needed for unbiased evaluation.
Incorrect! Try again.
Did this save you a night before the exam?
LPU Notes is free, and it stays free. Ads cover part of the server bill.
The rest comes out of a student's own pocket: the domain, the storage,
and keeping the site up through the weeks everyone needs it at once.
The payment button didn't load. An ad blocker or a filtered network is the usual reason.
to try again.
Nothing here is ever locked, and nothing unlocks. Chip in only if it was worth it.
What it pays for →