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