A) The data is labeled, meaning each example is paired with a target output. B) The data is unlabeled, and the model must find patterns on its own C) The data is generated randomly by the algorithm. D) The data is always image-based.
A) Memorize the entire training dataset perfectly. B) Discover hidden patterns without any guidance C) Reduce the dimensionality of the input data for visualization. D) Generalize from the training data to make accurate predictions on new, unseen data.
A) The loss function B) The label or target output. C) The model's parameters. D) The input features.
A) Predicting the selling price of a house based on its features. B) Estimating the annual revenue of a company. C) Forecasting the temperature for tomorrow. 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 classify emails into spam and non-spam folders B) To predict a target variable based on labeled examples C) To discover the inherent structure, patterns, or relationships within unlabeled data. D) To achieve perfect accuracy on a held-out test set.
A) Classification B) Regression C) Clustering D) Reinforcement Learning.
A) Clustering, a type of unsupervised learning. B) A support vector machine for classification. C) Linear Regression, a type of supervised learning. D) Logistic Regression, a type of supervised learning.
A) Reduce the number of features while preserving the most important information in the data. B) Increase the number of features to improve model accuracy. C) Assign categorical labels to each data point. D) Predict a continuous output variable.
A) Association rule learning in unsupervised learning. B) Regression in supervised learning. C) Classification in supervised learning. D) Deep learning with neural networks.
A) It is simpler to implement than unsupervised learning. B) It requires no labeled data at all. C) It is always more accurate than fully supervised learning. D) Labeling data is often expensive and time-consuming, so it leverages a small labeled set with a large unlabeled set.
A) "Is this pattern anomalous?" B) "How much?" or "How many?" C) "What is the underlying group?" D) "Which category?"
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) Linear Regression. B) k-Nearest Neighbors for classification. C) Logistic Regression. D) Decision Tree for classification.
A) Regression. B) Multi-class classification. C) Dimensionality reduction. D) Clustering.
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) A categorical class label. B) The name of the feature used for splitting. C) A random number. D) A continuous value, often the mean of the target values of the training instances that reach the leaf.
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) Guarantee to find the global optimum for any dataset. 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) Initialize the weights of a neural network. C) Perform linear regression more efficiently. D) Grow a tree structure by making sequential decisions.
A) The axes of the original feature space. B) The weights of a neural network layer. 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 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 superior interpretability and simplicity. D) Their inherent resistance to any form of overfitting.
A) Training or model fitting. B) Clustering. C) Data preprocessing. D) Dimensionality reduction.
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) Dimensionality Reduction techniques like Principal Component Analysis (PCA). B) An Association rule learning algorithm. C) A Regression algorithm like Linear Regression. D) A Classification algorithm like Logistic Regression.
A) Classification, a supervised learning method. B) Regression, a supervised learning method. C) Clustering, an unsupervised learning method. D) A neural network for image recognition.
A) Artificial neuron or perceptron, which receives inputs, applies a transformation, and produces an output. B) Principal component. C) Decision node in a tree. D) Support vector.
A) Kernel function. B) Loss function. C) Optimization algorithm. D) Activation function.
A) A constant function. B) The identity function (f(x) = x). C) The mean squared error function. D) Rectified Linear Unit (ReLU).
A) Manually setting the weights based on expert knowledge. B) Randomly assigning weights and never changing them. C) Iteratively adjusting the weights and biases to minimize a loss function. D) Clustering the input data.
A) Perform clustering on the output layer. B) Initialize the weights before training. 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) Simple linear regression models. B) Decision trees with a single split. C) K-means clustering exclusively. D) Neural networks with many layers (hence "deep").
A) Be perfectly interpretable, like a decision tree. B) Operate without any need for data preprocessing. C) Always train faster and with less data. D) Automatically learn hierarchical feature representations from data.
A) Unsupervised clustering of audio signals. B) Tabular data with many categorical features. 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) Flatten the input into a single vector. C) Perform the final classification. 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) Static, non-temporal data. D) Independent and identically distributed (IID) data points.
A) The model overfitting to the training data. B) The loss function reaching a perfect value of zero. C) The gradients becoming too large and causing numerical instability. D) The gradients becoming exceedingly small as they are backpropagated through many layers, which can halt learning in early layers.
A) Fit the model's parameters (e.g., the weights in a neural network). B) Deploy the model in a production environment. C) Provide an unbiased evaluation of a final model's performance. D) Tune the model's hyperparameters.
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 evaluated using the training set instead of a test set. B) Fails to learn the underlying pattern in the training data. C) Learns the training data too well, including its noise and outliers, and performs poorly on new, unseen data. D) Is too simple to capture the trends in the data.
A) Training for more epochs without any checks. B) Increasing the model's capacity by adding more layers. C) Dropout, which randomly ignores a subset of neurons during training. D) Using a smaller training dataset.
A) The error from sensitivity to small fluctuations in the training set, leading to overfitting. B) The weights connecting the input layer to the hidden layer. C) The error from erroneous assumptions in the learning algorithm, leading to underfitting. D) The activation function used in the output layer.
A) The intercept term in a linear regression model. B) The error from erroneous assumptions in the learning algorithm, leading to underfitting. C) The speed at which the model trains. D) The error from sensitivity to small fluctuations in the training set, leading to overfitting.
A) Bias and variance can be minimized to zero simultaneously. B) Decreasing bias will typically increase variance, and vice versa. The goal is to find a balance. C) Only bias is important for model performance. D) Only variance is important for model performance.
A) A well-generalized model. B) Overfitting. C) Perfect model performance. D) Underfitting.
A) The speed of the backpropagation algorithm. B) How well the model is performing on the training data; it's the quantity we want to minimize during training. C) The number of layers in the network. D) The accuracy on the test set.
A) Guarantees finding the global minimum for any loss function. B) Randomly searches the parameter space for a good solution. C) Iteratively adjusts parameters in the direction that reduces the loss function. D) Is only used for unsupervised learning.
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 amount of training data used in each epoch. D) The activation function for the output layer.
A) A type of regularization technique. B) One complete pass of the entire training dataset through the learning algorithm. C) The processing of a single training example. D) The final evaluation on the test set.
A) The number of validation examples. B) The number of layers in the network. C) The number of training examples used in one forward/backward pass before the model's parameters are updated. D) The total number of examples in the training set.
A) 1, meaning the parameters are updated after each individual training example. B) A random number between 1 and 100. C) Exactly 50% of the training set. D) The entire training set. |