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