A) The data is unlabeled, and the model must find patterns on its own B) The data is labeled, meaning each example is paired with a target output. C) The data is generated randomly by the algorithm. D) The data is always image-based.
A) Memorize the entire training dataset perfectly. B) Generalize from the training data to make accurate predictions on new, unseen data. C) Reduce the dimensionality of the input data for visualization. D) Discover hidden patterns without any guidance
A) The loss function B) The input features. C) The label or target output. D) The model's parameters.
A) Predicting the selling price of a house based on its features. B) Estimating the annual revenue of a company. C) Diagnosing a tumor as malignant or benign based on medical images. D) Forecasting the temperature for tomorrow.
A) Clustering problem. B) Regression problem. C) Dimensionality reduction problem D) Classification problem
A) To classify emails into spam and non-spam folders B) To achieve perfect accuracy on a held-out test set. C) To discover the inherent structure, patterns, or relationships within unlabeled data. D) To predict a target variable based on labeled examples
A) Classification B) Clustering C) Regression D) Reinforcement Learning.
A) Clustering, a type of unsupervised learning. B) A support vector machine for classification. C) Logistic Regression, a type of supervised learning. D) Linear Regression, a type of supervised learning.
A) Reduce the number of features while preserving the most important information in the data. B) Assign categorical labels to each data point. C) Increase the number of features to improve model accuracy. D) Predict a continuous output variable.
A) Regression in supervised learning. B) Deep learning with neural networks. C) Classification in supervised learning. D) Association rule learning in unsupervised learning.
A) It requires no labeled data at all. B) It is always more accurate than fully supervised learning. C) It is simpler to implement than unsupervised learning. D) Labeling data is often expensive and time-consuming, so it leverages a small labeled set with a large unlabeled set.
A) "How much?" or "How many?" B) "Which category?" C) "What is the underlying group?" D) "Is this pattern anomalous?"
A) "How can I reduce the number of features?" B) "What is the correlation between these variables?" C) "How much?" or "How many?" D) "Which category?" or "What class?"
A) k-Nearest Neighbors for classification. B) Linear Regression. C) Logistic Regression. D) Decision Tree for classification.
A) Clustering. B) Dimensionality reduction. C) Regression. D) Multi-class classification.
A) The input features for a new data point. B) The probability of moving to the next node. C) The final class labels or decisions. D) The average value of a continuous target.
A) The name of the feature used for splitting. B) A continuous value, often the mean of the target values of the training instances that reach the leaf. C) A categorical class label. D) A random number.
A) Superior performance on all types of data compared to other algorithms. B) Guarantee to find the global optimum for any dataset. C) Interpretability; the model's decision-making process is easy to understand and visualize. D) Immunity to overfitting on noisy datasets.
A) Find a linear separating hyperplane in a high-dimensional feature space, even when the data is not linearly separable in the original space. B) Perform linear regression more efficiently. C) Grow a tree structure by making sequential decisions. D) Initialize the weights of a neural network.
A) The weights of a neural network layer. B) The axes of the original feature space. C) Data points that are closest to the decision boundary and most critical for defining the optimal hyperplane. D) All data points in the training set.
A) Their effectiveness in high-dimensional spaces and their ability to model complex, non-linear decision boundaries. B) Their superior interpretability and simplicity. C) Their lower computational cost for very large datasets. D) Their inherent resistance to any form of overfitting.
A) Clustering. B) Data preprocessing. C) Dimensionality reduction. D) Training or model fitting.
A) The models are always less accurate than supervised models. B) The data is always too small. C) There are no ground truth labels to compare the results against. D) The algorithms are not well-defined.
A) A Regression algorithm like Linear Regression. B) An Association rule learning algorithm. C) Dimensionality Reduction techniques like Principal Component Analysis (PCA). D) A Classification algorithm like Logistic Regression.
A) Clustering, an unsupervised learning method. B) A neural network for image recognition. C) Regression, a supervised learning method. D) Classification, a supervised learning method.
A) Support vector. B) Decision node in a tree. C) Principal component. D) Artificial neuron or perceptron, which receives inputs, applies a transformation, and produces an output.
A) Optimization algorithm. B) Loss function. C) Activation function. D) Kernel function.
A) A constant function. B) Rectified Linear Unit (ReLU). C) The identity function (f(x) = x). D) The mean squared error function.
A) Manually setting the weights based on expert knowledge. B) Randomly assigning weights and never changing them. C) Clustering the input data. D) Iteratively adjusting the weights and biases to minimize a loss function.
A) Visualize the network's architecture. B) Initialize the weights before training. C) Efficiently calculate the gradient of the loss function with respect to all the weights in the network, enabling the use of gradient descent. D) Perform clustering on the output layer.
A) Decision trees with a single split. B) Neural networks with many layers (hence "deep"). C) Simple linear regression models. D) K-means clustering exclusively.
A) Operate without any need for data preprocessing. B) Be perfectly interpretable, like a decision tree. C) Automatically learn hierarchical feature representations from data. D) Always train faster and with less data.
A) Image data, due to their architecture which exploits spatial locality. B) Text data and natural language processing. C) Tabular data with many categorical features. D) Unsupervised clustering of audio signals.
A) Perform the final classification. B) Initialize the weights of the network. C) Detect local features (like edges or textures) in the input by applying a set of learnable filters. D) Flatten the input into a single vector.
A) Only image data. B) Static, non-temporal data. C) Sequential data, like time series or text, due to their internal "memory" of previous inputs. D) Independent and identically distributed (IID) data points.
A) The gradients becoming too large and causing numerical instability. B) The model overfitting to the training data. C) The loss function reaching a perfect value of zero. D) The gradients becoming exceedingly small as they are backpropagated through many layers, which can halt learning in early layers.
A) Deploy the model in a production environment. B) Provide an unbiased evaluation of a final model's performance. C) Fit the model's parameters (e.g., the weights in a neural network). D) Tune the model's hyperparameters.
A) The final, unbiased assessment of the model's generalization error. B) Tuning hyperparameters and making decisions about the model architecture during development. C) The initial training of the model's weights. D) Data preprocessing and cleaning.
A) Used repeatedly to tune the model's hyperparameters. B) Ignored in the machine learning pipeline. C) Used only once, for a final evaluation of the model's performance on unseen data after model development is complete. D) Used as part of the training data to improve accuracy.
A) Learns the training data too well, including its noise and outliers, and performs poorly on new, unseen data. B) Fails to learn the underlying pattern in the training data. C) Is too simple to capture the trends in the data. D) Is evaluated using the training set instead of a test set.
A) Using a smaller training dataset. B) Training for more epochs without any checks. C) Dropout, which randomly ignores a subset of neurons during training. D) Increasing the model's capacity by adding more layers.
A) The error from sensitivity to small fluctuations in the training set, leading to overfitting. B) The error from erroneous assumptions in the learning algorithm, leading to underfitting. C) The activation function used in the output layer. D) The weights connecting the input layer to the hidden layer.
A) The error from erroneous assumptions in the learning algorithm, leading to underfitting. B) The error from sensitivity to small fluctuations in the training set, leading to overfitting. C) The intercept term in a linear regression model. D) The speed at which the model trains.
A) Decreasing bias will typically increase variance, and vice versa. The goal is to find a balance. B) Bias and variance can be minimized to zero simultaneously. C) Only variance is important for model performance. D) Only bias is important for model performance.
A) Underfitting. B) A well-generalized model. C) Perfect model performance. D) Overfitting.
A) The number of layers in the network. B) The accuracy on the test set. C) How well the model is performing on the training data; it's the quantity we want to minimize during training. D) The speed of the backpropagation algorithm.
A) Iteratively adjusts parameters in the direction that reduces the loss function. B) Guarantees finding the global minimum for any loss function. C) Randomly searches the parameter space for a good solution. D) Is only used for unsupervised learning.
A) The amount of training data used in each epoch. B) The size of the step taken during each parameter update. A rate that is too high can cause divergence, while one that is too low can make training slow. C) The activation function for the output layer. D) The number of layers in a neural network.
A) One complete pass of the entire training dataset through the learning algorithm. B) The final evaluation on the test set. C) A type of regularization technique. D) The processing of a single training example.
A) The number of layers in the network. B) The number of validation examples. C) The total number of examples in the training set. D) The number of training examples used in one forward/backward pass before the model's parameters are updated.
A) A random number between 1 and 100. B) Exactly 50% of the training set. C) 1, meaning the parameters are updated after each individual training example. D) The entire training set. |