A) The data is generated randomly by the algorithm. B) The data is unlabeled, and the model must find patterns on its own C) The data is always image-based. D) The data is labeled, meaning each example is paired with a target output.
A) Discover hidden patterns without any guidance 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) Memorize the entire training dataset perfectly.
A) The loss function B) The label or target output. C) The model's parameters. D) The input features.
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) Classification problem B) Dimensionality reduction problem C) Clustering problem. D) Regression problem.
A) To predict a target variable based on labeled examples B) To achieve perfect accuracy on a held-out test set. C) To classify emails into spam and non-spam folders D) To discover the inherent structure, patterns, or relationships within unlabeled data.
A) Reinforcement Learning. B) Regression C) Clustering D) Classification
A) Linear Regression, a type of supervised learning. B) A support vector machine for classification. C) Clustering, a type of unsupervised learning. D) Logistic Regression, a type of supervised learning.
A) Predict a continuous output variable. B) Assign categorical labels to each data point. C) Increase the number of features to improve model accuracy. 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) Labeling data is often expensive and time-consuming, so it leverages a small labeled set with a large unlabeled set. B) It is always more accurate than fully supervised learning. C) It requires no labeled data at all. D) It is simpler to implement than unsupervised learning.
A) "Is this pattern anomalous?" B) "How much?" or "How many?" C) "What is the underlying group?" D) "Which category?"
A) "How much?" or "How many?" B) "How can I reduce the number of features?" C) "Which category?" or "What class?" D) "What is the correlation between these variables?"
A) Decision Tree for classification. B) k-Nearest Neighbors for classification. C) Linear Regression. D) Logistic Regression.
A) Dimensionality reduction. B) Clustering. C) Multi-class classification. D) Regression.
A) The input features for a new data point. B) The average value of a continuous target. C) The final class labels or decisions. 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) Superior performance on all types of data compared to other algorithms. B) Interpretability; the model's decision-making process is easy to understand and visualize. C) Guarantee to find the global optimum for any dataset. D) Immunity to overfitting on noisy datasets.
A) Perform linear regression more efficiently. B) Find a linear separating hyperplane in a high-dimensional feature space, even when the data is not linearly separable in the original space. C) Grow a tree structure by making sequential decisions. D) Initialize the weights of a neural network.
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) 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 superior interpretability and simplicity. D) Their effectiveness in high-dimensional spaces and their ability to model complex, non-linear decision boundaries.
A) Data preprocessing. B) Dimensionality reduction. C) Training or model fitting. D) Clustering.
A) The models are always less accurate than supervised models. B) There are no ground truth labels to compare the results against. C) The algorithms are not well-defined. D) The data is always too small.
A) An Association rule learning algorithm. B) A Classification algorithm like Logistic Regression. C) Dimensionality Reduction techniques like Principal Component Analysis (PCA). D) A Regression algorithm like Linear Regression.
A) Clustering, an unsupervised learning method. B) Regression, a supervised learning method. C) Classification, a supervised learning method. D) A neural network for image recognition.
A) Decision node in a tree. B) Principal component. C) Support vector. D) Artificial neuron or perceptron, which receives inputs, applies a transformation, and produces an output.
A) Kernel function. B) Optimization algorithm. C) Activation function. D) Loss function.
A) Rectified Linear Unit (ReLU). B) The mean squared error function. C) The identity function (f(x) = x). D) A constant function.
A) Manually setting the weights based on expert knowledge. B) Iteratively adjusting the weights and biases to minimize a loss function. C) Randomly assigning weights and never changing them. 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) 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) Automatically learn hierarchical feature representations from data. C) Be perfectly interpretable, like a decision tree. D) Operate without any need for data preprocessing.
A) Tabular data with many categorical features. B) Image data, due to their architecture which exploits spatial locality. C) Text data and natural language processing. D) Unsupervised clustering of audio signals.
A) Perform the final classification. B) Flatten the input into a single vector. C) Initialize the weights of the network. D) Detect local features (like edges or textures) in the input by applying a set of learnable filters.
A) Only image data. B) Static, non-temporal 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 loss function reaching a perfect value of zero. B) The model overfitting to the training data. 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) Deploy the model in a production environment. C) Provide an unbiased evaluation of a final model's performance. D) Tune the model's hyperparameters.
A) Data preprocessing and cleaning. B) The initial training of the model's weights. C) Tuning hyperparameters and making decisions about the model architecture during development. D) The final, unbiased assessment of the model's generalization error.
A) Ignored in the machine learning pipeline. B) Used repeatedly to tune the model's hyperparameters. C) Used as part of the training data to improve accuracy. 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) Is too simple to capture the trends in the data. C) Learns the training data too well, including its noise and outliers, and performs poorly on new, unseen data. D) Fails to learn the underlying pattern in the training data.
A) Training for more epochs without any checks. B) Using a smaller training dataset. C) Dropout, which randomly ignores a subset of neurons during training. D) Increasing the model's capacity by adding more layers.
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 activation function used in the output layer. D) The error from sensitivity to small fluctuations in the training set, leading to overfitting.
A) The speed at which the model trains. 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 intercept term in a linear regression model.
A) Only bias is important for model performance. B) Decreasing bias will typically increase variance, and vice versa. The goal is to find a balance. C) Only variance is important for model performance. D) Bias and variance can be minimized to zero simultaneously.
A) A well-generalized model. B) Underfitting. C) Perfect model performance. D) Overfitting.
A) The accuracy on the test set. 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 number of layers in the network.
A) Guarantees finding the global minimum for any loss function. B) Iteratively adjusts parameters in the direction that reduces the loss function. C) Is only used for unsupervised learning. 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 amount of training data used in each epoch. C) The number of layers in a neural network. D) The activation function for the output layer.
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 total number of examples in the training set. B) The number of layers in the network. C) The number of training examples used in one forward/backward pass before the model's parameters are updated. D) The number of validation examples.
A) A random number between 1 and 100. B) 1, meaning the parameters are updated after each individual training example. C) The entire training set. D) Exactly 50% of the training set. |