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