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