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