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