The model correctly predicts a negative class<\/span><\/p>\nAnswer: 1) The model predicts positive when the actual class is negative<\/b><\/p>\n
Explanation:<\/b><\/p>\n
A false positive occurs when a classification model predicts the positive class even though the actual observation belongs to the negative class. For example, a fraud detection system could flag a legitimate transaction as fraudulent. False positives are important when incorrect positive alerts create unnecessary costs or inconvenience. In a confusion matrix, false positives appear in the predicted-positive and actual-negative category. Metrics such as precision are affected by false positives because precision measures the proportion of predicted positives that are actually positive. Understanding false positives helps practitioners select appropriate classification thresholds and evaluate the business impact of model errors.<\/span><\/p>\nQuestion 282. In binary classification, what does a false negative indicate?<\/b><\/h3>\n
1)<\/b> A negative case correctly classified as negative<\/span>
\n<\/span>2)<\/b> A positive case incorrectly classified as negative<\/span>
\n<\/span>3)<\/b> A negative case incorrectly classified as positive<\/span>
\n<\/span>4)<\/b> A positive case correctly classified as positive<\/span><\/p>\nAnswer: 2) A positive case incorrectly classified as negative<\/b><\/p>\n
Explanation:<\/b><\/p>\n
A false negative occurs when the actual class is positive but the model predicts the negative class. For example, in a medical screening scenario, a condition may be present but the model fails to identify it. False negatives are represented in the confusion matrix as actual positives that were predicted as negatives. Recall is particularly sensitive to false negatives because recall measures how many actual positive cases the model successfully identifies. Reducing false negatives may require adjusting the classification threshold, changing the model, improving features, or applying a cost-sensitive approach when missing positive cases has significant consequences.<\/span><\/p>\nQuestion 283. What does a Receiver Operating Characteristic (ROC) curve primarily show?<\/b><\/h3>\n
1)<\/b> Model accuracy against training time<\/span>
\n<\/span>2)<\/b> Precision against recall for different thresholds<\/span>
\n<\/span>3)<\/b> True positive rate against false positive rate across thresholds<\/span>
\n<\/span>4)<\/b> Mean squared error against model complexity<\/span><\/p>\nAnswer: 3) True positive rate against false positive rate across thresholds<\/b><\/p>\n
Explanation:<\/b><\/p>\n
A Receiver Operating Characteristic, or ROC, curve illustrates how a binary classification model behaves across different decision thresholds. It plots the true positive rate on one axis and the false positive rate on the other. Each threshold produces a different combination of these two rates, allowing practitioners to examine the model’s discrimination behavior. The area under the ROC curve, commonly called ROC-AUC, summarizes this behavior into a single measure of ranking ability. ROC curves are useful when comparing classifiers and understanding the trade-off between detecting positive cases and generating false alarms.<\/span><\/p>\nQuestion 284. When is a precision-recall curve particularly useful for evaluating a classification model?<\/b><\/h3>\n
1)<\/b> When the target variable is always continuous<\/span>
\n<\/span>2)<\/b> When there are no classification errors<\/span>
\n<\/span>3)<\/b> When all classes have exactly equal frequencies<\/span>
\n<\/span>4)<\/b> When the positive class is relatively rare or class imbalance is important<\/span><\/p>\nAnswer: 4) When the positive class is relatively rare or class imbalance is important<\/b><\/p>\n
Explanation:<\/b><\/p>\n
A precision-recall curve is especially useful when the positive class is relatively uncommon. It shows the relationship between precision and recall as the classification threshold changes. In highly imbalanced datasets, accuracy can appear high even when the model performs poorly on the minority positive class. Precision-recall analysis focuses directly on positive predictions and the ability to retrieve actual positives. This makes it useful for applications such as fraud detection, anomaly identification, or rare-event classification. Practitioners can examine the trade-off between catching more positive cases and maintaining a useful proportion of correct positive predictions.<\/span><\/p>\nQuestion 285. What is the primary effect of changing the classification threshold of a binary model?<\/b><\/h3>\n
1)<\/b> It changes the balance between predicted positive and negative outcomes<\/span>
\n<\/span>2)<\/b> It permanently changes the model’s training data<\/span>
\n<\/span>3)<\/b> It removes all false positives and false negatives<\/span>
\n<\/span>4)<\/b> It changes the number of features used during training<\/span><\/p>\nAnswer: 1) It changes the balance between predicted positive and negative outcomes<\/b><\/p>\n
Explanation:<\/b><\/p>\n
A classification threshold determines how predicted probabilities are converted into class labels. For example, a model might classify an observation as positive when its predicted probability exceeds a selected threshold. Lowering the threshold generally causes more observations to be classified as positive, which can increase recall while also increasing false positives. Raising the threshold generally produces fewer positive predictions and can have the opposite effect. Threshold selection should therefore consider the application’s error costs and operational requirements. Changing the threshold does not retrain the model or modify its learned parameters; it changes the decision rule applied after prediction.<\/span><\/p>\nQuestion 286. Which metric measures the mean squared difference between predicted probabilities and actual binary outcomes?<\/b><\/h3>\n
1)<\/b> ROC-AUC<\/span>
\n<\/span>2)<\/b> Brier score<\/span>
\n<\/span>3)<\/b> F1 score<\/span>
\n<\/span>4)<\/b> Specificity<\/span><\/p>\nAnswer: 2) Brier score<\/b><\/p>\n
Explanation:<\/b><\/p>\n
The Brier score evaluates the accuracy of probabilistic predictions for binary outcomes. It is calculated using the squared difference between the predicted probability and the actual outcome, then averaging those squared differences across observations. A lower Brier score indicates that predicted probabilities are, on average, closer to the observed outcomes. Unlike metrics that primarily evaluate ranking or classification labels, the Brier score considers the quality of probability estimates themselves. This makes it useful when a model’s predicted probabilities are important for downstream decisions, risk estimation, prioritization, or other applications where calibrated probability information matters.<\/span><\/p>\nQuestion 287. In a decision tree, what does entropy measure when selecting a split?<\/b><\/h3>\n
1)<\/b> The number of observations in the training dataset<\/span>
\n<\/span>2)<\/b> The computational cost of the tree<\/span>
\n<\/span>3)<\/b> The impurity or uncertainty of the class distribution<\/span>
\n<\/span>4)<\/b> The number of features available for prediction<\/span><\/p>\nAnswer: 3) The impurity or uncertainty of the class distribution<\/b><\/p>\n
Explanation:<\/b><\/p>\n
Entropy is a measure of impurity or uncertainty used in some decision-tree algorithms when evaluating candidate splits. A node containing observations from multiple classes has greater uncertainty than a node dominated by a single class. A split can therefore be evaluated based on how much it reduces entropy in the resulting child nodes. This reduction is commonly associated with information gain. The objective is to create child nodes that are more homogeneous with respect to the target classes. Entropy is not a measure of computational cost or dataset size; it describes the uncertainty in the class distribution at a node.<\/span><\/p>\nQuestion 288. What does Gini impurity measure in a classification decision tree?<\/b><\/h3>\n
1)<\/b> The average prediction error of a regression model<\/span>
\n<\/span>2)<\/b> The number of leaves in the tree<\/span>
\n<\/span>3)<\/b> The training time required by the algorithm<\/span>
\n<\/span>4)<\/b> The likelihood that a randomly selected observation would be incorrectly classified based on the node distribution<\/span><\/p>\nAnswer: 4) The likelihood that a randomly selected observation would be incorrectly classified based on the node distribution<\/b><\/p>\n
Explanation:<\/b><\/p>\n
Gini impurity is a measure commonly used by classification decision trees to evaluate the purity of nodes. It represents the expected probability of incorrect classification when an observation is randomly labeled according to the class distribution within that node. A node containing observations from only one class has zero Gini impurity because there is no class uncertainty. Higher impurity occurs when multiple classes are more evenly represented. During tree construction, candidate splits can be compared by how effectively they reduce impurity. This helps the algorithm create child nodes containing increasingly homogeneous class distributions.<\/span><\/p>\nQuestion 289. What is a key characteristic of a random forest model?<\/b><\/h3>\n
1)<\/b> It combines predictions from multiple decision trees<\/span>
\n<\/span>2)<\/b> It uses only one decision tree with unlimited depth<\/span>
\n<\/span>3)<\/b> It requires every tree to use exactly the same training subset<\/span>
\n<\/span>4)<\/b> It can only solve regression problems<\/span><\/p>\nAnswer: 1) It combines predictions from multiple decision trees<\/b><\/p>\n
Explanation:<\/b><\/p>\n
A random forest is an ensemble learning method that combines predictions from multiple decision trees. During training, individual trees are typically created using different bootstrap samples and randomized subsets of features. For classification, the forest can aggregate tree predictions through voting, while regression predictions can be combined by averaging. This approach can reduce the instability associated with relying on a single decision tree. Random forests can be used for both classification and regression tasks. Their ensemble structure also makes them less dependent on the exact training sample or feature selection used by any individual tree.<\/span><\/p>\nQuestion 290. Which type of problem is logistic regression commonly used to solve?<\/b><\/h3>\n
1)<\/b> Image segmentation without labels<\/span>
\n<\/span>2)<\/b> Binary classification<\/span>
\n<\/span>3)<\/b> Unsupervised clustering<\/span>
\n<\/span>4)<\/b> Time-series decomposition only<\/span><\/p>\nAnswer: 2) Binary classification<\/b><\/p>\n
Explanation:<\/b><\/p>\n
Logistic regression is a supervised learning algorithm commonly used for binary classification. It estimates the probability that an observation belongs to a particular class by applying a logistic function to a weighted combination of input features. The resulting probability can then be converted into a class prediction using a selected threshold. Logistic regression is useful when a relatively interpretable classification model is desired. Despite its name, it is primarily used for classification rather than ordinary continuous-value regression. Variations and extensions can also support multiclass classification, but the basic form is commonly associated with predicting one of two possible classes.<\/span><\/p>\nQuestion 291. What is multiclass classification?<\/b><\/h3>\n
1)<\/b> Predicting several continuous numerical values<\/span>
\n<\/span>2)<\/b> Predicting only whether an observation is positive or negative<\/span>
\n<\/span>3)<\/b> Assigning an observation to one of more than two mutually exclusive classes<\/span>
\n<\/span>4)<\/b> Assigning multiple unrelated labels to every observation<\/span><\/p>\nAnswer: 3) Assigning an observation to one of more than two mutually exclusive classes<\/b><\/p>\n
Explanation:<\/b><\/p>\n
Multiclass classification is a supervised learning problem in which each observation is assigned to one class from more than two possible mutually exclusive classes. For example, a model might classify an image as a cat, dog, bird, or car, assuming only one category can be selected for each observation. This differs from binary classification, which has two classes, and multilabel classification, where multiple labels can simultaneously apply to one observation. Multiclass problems can be addressed using algorithms designed for multiple classes or strategies that combine multiple binary classifiers. Evaluation should account for performance across all target classes.<\/span><\/p>\nQuestion 292. What distinguishes multilabel classification from multiclass classification?<\/b><\/h3>\n
1)<\/b> Multilabel classification can only contain two labels<\/span>
\n<\/span>2)<\/b> Multilabel classification does not require training data<\/span>
\n<\/span>3)<\/b> Multilabel classification is limited to regression problems<\/span>
\n<\/span>4)<\/b> One observation can receive multiple labels simultaneously<\/span><\/p>\nAnswer: 4) One observation can receive multiple labels simultaneously<\/b><\/p>\n
Explanation:<\/b><\/p>\n
In multilabel classification, a single observation can belong to multiple target categories at the same time. For example, an image could simultaneously contain labels such as beach, ocean, and sunset. This differs from ordinary multiclass classification, where the observation is assigned to one class from a set of mutually exclusive classes. Multilabel tasks often require evaluation methods that account for multiple predicted labels, such as label-wise precision and recall or suitable aggregate measures. The distinction is important because the model’s output structure and evaluation process must reflect whether categories are mutually exclusive or can occur together.<\/span><\/p>\nQuestion 293. Which clustering algorithm is particularly useful for discovering dense regions while identifying noise points?<\/b><\/h3>\n
1)<\/b> DBSCAN<\/span>
\n<\/span>2)<\/b> Linear regression<\/span>
\n<\/span>3)<\/b> Logistic regression<\/span>
\n<\/span>4)<\/b> Naive Bayes<\/span><\/p>\nAnswer: 1) DBSCAN<\/b><\/p>\n
Explanation:<\/b><\/p>\n
DBSCAN, or Density-Based Spatial Clustering of Applications with Noise, is an unsupervised clustering algorithm that groups observations based on local density. It identifies dense regions and can classify observations in sparse areas as noise or outliers. Unlike some clustering methods, DBSCAN does not require the user to specify the number of clusters in advance. It uses parameters related to neighborhood distance and the minimum number of observations needed to form a dense region. DBSCAN can be particularly useful when clusters have irregular shapes and when identifying noise is valuable. Its effectiveness depends on suitable distance and density parameters.<\/span><\/p>\nQuestion 294. What is a characteristic of hierarchical clustering?<\/b><\/h3>\n
1)<\/b> It always requires exactly two clusters<\/span>
\n<\/span>2)<\/b> It can build a hierarchy of clusters that can be represented as a dendrogram<\/span>
\n<\/span>3)<\/b> It can only be used with labeled training data<\/span>
\n<\/span>4)<\/b> It requires a predefined neural-network architecture<\/span><\/p>\nAnswer: 2) It can build a hierarchy of clusters that can be represented as a dendrogram<\/b><\/p>\n
Explanation:<\/b><\/p>\n
Hierarchical clustering creates a nested structure of groups rather than producing only one fixed partition. In agglomerative hierarchical clustering, each observation can initially be treated as its own cluster, and similar clusters are progressively merged. The resulting hierarchy can be represented visually using a dendrogram. By selecting a particular level of the hierarchy, practitioners can obtain a desired number of clusters. Hierarchical clustering is unsupervised, so labeled target values are not required. Different linkage methods, such as single, complete, or average linkage, determine how distances between clusters are calculated during the clustering process.<\/span><\/p>\nQuestion 295. Which similarity measure is commonly used to compare the orientation of two vectors, especially in text or embedding applications?<\/b><\/h3>\n
1)<\/b> Mean absolute error<\/span>
\n<\/span>2)<\/b> Gini impurity<\/span>
\n<\/span>3)<\/b> Cosine similarity<\/span>
\n<\/span>4)<\/b> Mean squared error<\/span><\/p>\nAnswer: 3) Cosine similarity<\/b><\/p>\n
Explanation:<\/b><\/p>\n
Cosine similarity measures the similarity between two vectors based on the angle between them rather than their absolute magnitudes. It is commonly used in text analysis, recommendation systems, and embedding-based applications. Vectors pointing in similar directions have a cosine similarity closer to one, while vectors pointing in opposite directions have lower values. This makes cosine similarity useful when the orientation of representations is more important than their size. For example, two text embeddings can have different magnitudes but still represent similar semantic information. Cosine similarity is therefore frequently used to compare high-dimensional feature or embedding vectors.<\/span><\/p>\nQuestion 296. What is the main purpose of TF-IDF in natural language processing?<\/b><\/h3>\n
1)<\/b> To convert images into bounding boxes<\/span>
\n<\/span>2)<\/b> To train neural networks without any text data<\/span>
\n<\/span>3)<\/b> To calculate classification accuracy<\/span>
\n<\/span>4)<\/b> To represent words based on their importance within documents and a document collection<\/span><\/p>\nAnswer: 4) To represent words based on their importance within documents and a document collection<\/b><\/p>\n
Explanation:<\/b><\/p>\n
TF-IDF, or Term Frequency-Inverse Document Frequency, is a technique for representing the importance of terms in documents. Term frequency measures how often a word appears in a particular document, while inverse document frequency reduces the weight of words that appear frequently across many documents. As a result, terms that are common in one document but relatively uncommon across the collection can receive higher weights. TF-IDF is often used to convert text into numerical feature vectors for machine learning tasks such as document classification, search, and text similarity. It provides a simple alternative to more complex embedding approaches.<\/span><\/p>\nQuestion 297. What does an n-gram represent in natural language processing?<\/b><\/h3>\n
1)<\/b> A contiguous sequence of n items, such as words or characters<\/span>
\n<\/span>2)<\/b> A probability that a model is correctly calibrated<\/span>
\n<\/span>3)<\/b> A numerical image segmentation mask<\/span>
\n<\/span>4)<\/b> A clustering algorithm based on density<\/span><\/p>\nAnswer: 1) A contiguous sequence of n items, such as words or characters<\/b><\/p>\n
Explanation:<\/b><\/p>\n
An n-gram is a contiguous sequence of n units extracted from text. Depending on the application, the units can be words, characters, or other tokens. For example, a bigram contains two consecutive tokens, while a trigram contains three. N-grams can capture local context that individual words may miss. They are commonly used in text classification, language modeling, search, and feature engineering. However, increasing the value of n can substantially increase the number of possible features, which may create sparse and high-dimensional representations. Feature selection or regularization may therefore be useful when working with large n-gram vocabularies.<\/span><\/p>\nQuestion 298. In object detection, what does Intersection over Union (IoU) measure?<\/b><\/h3>\n
1)<\/b> The training time of an object-detection model<\/span>
\n<\/span>2)<\/b> The overlap between a predicted bounding box and the ground-truth bounding box<\/span>
\n<\/span>3)<\/b> The number of classes supported by the model<\/span>
\n<\/span>4)<\/b> The probability that an image contains no objects<\/span><\/p>\n