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