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 generated randomly by the algorithm. D) The data is unlabeled, and the model must find patterns on its own
A) Reduce the dimensionality of the input data for visualization. B) Generalize from the training data to make accurate predictions on new, unseen data. C) Memorize the entire training dataset perfectly. D) Discover hidden patterns without any guidance
A) The input features. B) The loss function C) The model's parameters. D) The label or target output.
A) Predicting the selling price of a house based on its features. B) Estimating the annual revenue of a company. C) Forecasting the temperature for tomorrow. D) Diagnosing a tumor as malignant or benign based on medical images.
A) Regression problem. B) Classification problem C) Clustering problem. D) Dimensionality reduction problem
A) To discover the inherent structure, patterns, or relationships within unlabeled data. B) To predict a target variable based on labeled examples 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) Regression C) Classification D) Clustering
A) Clustering, a type of unsupervised learning. B) Logistic Regression, a type of supervised learning. C) A support vector machine for classification. 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) Increase the number of features to improve model accuracy. D) Assign categorical labels to each data point.
A) Classification in supervised learning. B) Association rule learning in unsupervised learning. C) Regression in supervised 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 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) "How much?" or "How many?" D) "Is this pattern anomalous?"
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) Decision Tree for classification. C) Linear Regression. D) k-Nearest Neighbors for classification.
A) Multi-class classification. B) Clustering. C) Regression. D) Dimensionality reduction.
A) The average value of a continuous target. B) The probability of moving to the next node. C) The input features for a new data point. D) The final class labels or decisions.
A) A continuous value, often the mean of the target values of the training instances that reach the leaf. B) The name of the feature used for splitting. C) A random number. D) A categorical class label.
A) Immunity to overfitting on noisy datasets. B) Interpretability; the model's decision-making process is easy to understand and visualize. C) Superior performance on all types of data compared to other algorithms. D) Guarantee to find the global optimum for any dataset.
A) Perform linear regression more efficiently. B) Initialize the weights of a neural network. C) Grow a tree structure by making sequential decisions. 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) Data points that are closest to the decision boundary and most critical for defining the optimal hyperplane. C) The weights of a neural network layer. D) The axes of the original feature space.
A) Their lower computational cost for very large datasets. B) Their inherent resistance to any form of overfitting. C) Their effectiveness in high-dimensional spaces and their ability to model complex, non-linear decision boundaries. D) Their superior interpretability and simplicity.
A) Training or model fitting. B) Dimensionality reduction. C) Clustering. D) Data preprocessing.
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 Regression algorithm like Linear Regression. B) Dimensionality Reduction techniques like Principal Component Analysis (PCA). C) A Classification algorithm like Logistic Regression. D) An Association rule learning algorithm.
A) A neural network for image recognition. B) Regression, a supervised learning method. C) Clustering, an unsupervised learning method. D) Classification, a supervised learning method.
A) Support vector. B) Decision node in a tree. C) Principal component. D) Artificial neuron or perceptron, which receives inputs, applies a transformation, and produces an output.
A) Optimization algorithm. B) Activation function. C) Loss function. D) Kernel function.
A) The identity function (f(x) = x). B) A constant function. C) Rectified Linear Unit (ReLU). D) The mean squared error function.
A) Iteratively adjusting the weights and biases to minimize a loss function. B) Clustering the input data. C) Randomly assigning weights and never changing them. D) Manually setting the weights based on expert knowledge.
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) Text data and natural language processing. B) Image data, due to their architecture which exploits spatial locality. C) Unsupervised clustering of audio signals. D) Tabular data with many categorical features.
A) Detect local features (like edges or textures) in the input by applying a set of learnable filters. B) Perform the final classification. C) Flatten the input into a single vector. D) Initialize the weights of the network.
A) Independent and identically distributed (IID) data points. B) Static, non-temporal data. C) Only image data. 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 loss function reaching a perfect value of zero. C) The gradients becoming too large and causing numerical instability. D) The model overfitting to the training data.
A) Provide an unbiased evaluation of a final model's performance. B) Fit the model's parameters (e.g., the weights in a neural network). C) Tune the model's hyperparameters. D) Deploy the model in a production environment.
A) Data preprocessing and cleaning. B) The final, unbiased assessment of the model's generalization error. C) The initial training of the model's weights. D) Tuning hyperparameters and making decisions about the model architecture during development.
A) Used repeatedly to tune the model's hyperparameters. B) Used only once, for a final evaluation of the model's performance on unseen data after model development is complete. C) Used as part of the training data to improve accuracy. D) Ignored in the machine learning pipeline.
A) Fails to learn the underlying pattern in the training data. B) Is too simple to capture the trends in the data. C) Is evaluated using the training set instead of a test set. D) Learns the training data too well, including its noise and outliers, and performs poorly on new, unseen data.
A) Training for more epochs without any checks. B) Using a smaller training dataset. 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 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 weights connecting the input layer to the hidden layer.
A) The error from sensitivity to small fluctuations in the training set, leading to overfitting. B) The speed at which the model trains. C) The intercept term in a linear regression model. D) The error from erroneous assumptions in the learning algorithm, leading to underfitting.
A) Decreasing bias will typically increase variance, and vice versa. The goal is to find a balance. B) Only variance is important for model performance. C) Only bias is important for model performance. D) Bias and variance can be minimized to zero simultaneously.
A) A well-generalized model. B) Perfect model performance. C) Overfitting. D) Underfitting.
A) The speed of the backpropagation algorithm. B) How well the model is performing on the training data; it's the quantity we want to minimize during training. C) The number of layers in the network. D) The accuracy on the test set.
A) Iteratively adjusts parameters in the direction that reduces the loss function. B) Guarantees finding the global minimum for any loss function. C) Is only used for unsupervised learning. D) Randomly searches the parameter space for a good solution.
A) The number of layers in a neural network. B) The amount of training data used in each epoch. 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 activation function for the output layer.
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 number of validation examples. B) The total number of examples in the training set. 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) Exactly 50% of the training set. B) 1, meaning the parameters are updated after each individual training example. C) A random number between 1 and 100. D) The entire training set. |