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