A) The data is always image-based. B) The data is generated randomly by the algorithm. 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 input features. B) The model's parameters. C) The loss function D) The label or target output.
A) Forecasting the temperature for tomorrow. B) Estimating the annual revenue of a company. C) Diagnosing a tumor as malignant or benign based on medical images. D) Predicting the selling price of a house based on its features.
A) Classification problem B) Clustering problem. C) Dimensionality reduction problem D) Regression problem.
A) To classify emails into spam and non-spam folders B) To predict a target variable based on labeled examples C) To discover the inherent structure, patterns, or relationships within unlabeled data. D) To achieve perfect accuracy on a held-out test set.
A) Clustering B) Reinforcement Learning. C) Classification D) Regression
A) Clustering, a type of unsupervised learning. B) A support vector machine for classification. C) Linear Regression, a type of supervised learning. D) Logistic Regression, a type of supervised learning.
A) Increase the number of features to improve model accuracy. B) Assign categorical labels to each data point. 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) Association rule learning in unsupervised learning. C) Regression in supervised learning. D) Deep learning with neural networks.
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) "What is the underlying group?" D) "Is this pattern anomalous?"
A) "What is the correlation between these variables?" B) "How much?" or "How many?" C) "Which category?" or "What class?" D) "How can I reduce the number of features?"
A) k-Nearest Neighbors for classification. B) Logistic Regression. C) Linear Regression. D) Decision Tree for classification.
A) Clustering. B) Multi-class classification. C) Dimensionality reduction. D) Regression.
A) The input features for a new data point. B) The average value of a continuous target. C) The probability of moving to the next node. D) The final class labels or decisions.
A) A random number. 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 categorical class label.
A) Superior performance on all types of data compared to other algorithms. B) Guarantee to find the global optimum for any dataset. C) Immunity to overfitting on noisy datasets. D) Interpretability; the model's decision-making process is easy to understand and visualize.
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) Data points that are closest to the decision boundary and most critical for defining the optimal hyperplane. B) The weights of a neural network layer. C) The axes of the original feature space. D) All data points in the training set.
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 data is always too small. B) The models are always less accurate than supervised models. C) The algorithms are not well-defined. D) There are no ground truth labels to compare the results against.
A) A Classification algorithm like Logistic Regression. B) A Regression algorithm like Linear Regression. C) An Association rule learning algorithm. D) Dimensionality Reduction techniques like Principal Component Analysis (PCA).
A) Regression, a supervised learning method. B) A neural network for image recognition. C) Classification, a supervised learning method. D) Clustering, an unsupervised learning method.
A) Principal component. B) Decision node in a tree. C) Support vector. D) Artificial neuron or perceptron, which receives inputs, applies a transformation, and produces an output.
A) Loss function. B) Optimization algorithm. C) Kernel function. D) Activation function.
A) A constant function. B) The mean squared error function. C) The identity function (f(x) = x). D) Rectified Linear Unit (ReLU).
A) Clustering the input data. B) Manually setting the weights based on expert knowledge. 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) Efficiently calculate the gradient of the loss function with respect to all the weights in the network, enabling the use of gradient descent. D) Perform clustering on the output layer.
A) Neural networks with many layers (hence "deep"). B) Decision trees with a single split. C) Simple linear regression models. D) K-means clustering exclusively.
A) Be perfectly interpretable, like a decision tree. B) Operate without any need for data preprocessing. C) Automatically learn hierarchical feature representations from data. D) Always train faster and with less 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) Perform the final classification. B) Flatten the input into a single vector. 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 model overfitting to the training data. C) The gradients becoming exceedingly small as they are backpropagated through many layers, which can halt learning in early layers. D) The loss function reaching a perfect value of zero.
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) Tune the model's hyperparameters. D) Deploy the model in a production environment.
A) The initial training of the model's weights. B) Data preprocessing and cleaning. C) Tuning hyperparameters and making decisions about the model architecture during development. D) The final, unbiased assessment of the model's generalization error.
A) Used repeatedly to tune the model's hyperparameters. B) Used as part of the training data to improve accuracy. C) Used only once, for a final evaluation of the model's performance on unseen data after model development is complete. D) Ignored in the machine learning pipeline.
A) Is evaluated using the training set instead of a test set. B) Learns the training data too well, including its noise and outliers, and performs poorly on new, unseen data. 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) Increasing the model's capacity by adding more layers. C) Dropout, which randomly ignores a subset of neurons during training. D) Training for more epochs without any checks.
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 error from sensitivity to small fluctuations in the training set, leading to overfitting. D) The activation function used in the output layer.
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 error from erroneous assumptions in the learning algorithm, leading to underfitting. D) The speed at which the model trains.
A) Only variance is important for model performance. B) Only bias is important for model performance. C) Bias and variance can be minimized to zero simultaneously. 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 accuracy on the test set. C) The number of layers in the network. D) The speed of the backpropagation algorithm.
A) Randomly searches the parameter space for a good solution. B) Guarantees finding the global minimum for any loss function. C) Is only used for unsupervised learning. D) Iteratively adjusts parameters in the direction that reduces the loss function.
A) The activation function for the output layer. B) The number of layers in a neural network. C) The amount of training data used in each epoch. 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) One complete pass of the entire training dataset through the learning algorithm. B) The processing of a single training example. C) The final evaluation on the test set. D) A type of regularization technique.
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) 1, meaning the parameters are updated after each individual training example. C) Exactly 50% of the training set. D) A random number between 1 and 100. |