A) The data is labeled, meaning each example is paired with a target output. B) The data is always image-based. 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) Discover hidden patterns without any guidance C) Memorize the entire training dataset perfectly. D) Generalize from the training data to make accurate predictions on new, unseen data.
A) The label or target output. B) The loss function C) The input features. D) The model's parameters.
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 discover the inherent structure, patterns, or relationships within unlabeled data. B) To predict a target variable based on labeled examples C) To achieve perfect accuracy on a held-out test set. D) To classify emails into spam and non-spam folders
A) Clustering B) Reinforcement Learning. C) Regression D) Classification
A) A support vector machine for classification. B) Logistic Regression, a type of supervised learning. C) Linear Regression, a type of supervised learning. D) Clustering, a type of unsupervised learning.
A) Assign categorical labels to each data point. B) Increase the number of features to improve model accuracy. 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) 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) "Is this pattern anomalous?" B) "Which category?" C) "What is the underlying group?" D) "How much?" or "How many?"
A) "How much?" or "How many?" B) "What is the correlation between these variables?" C) "How can I reduce the number of features?" D) "Which category?" or "What class?"
A) Decision Tree for classification. B) Logistic Regression. C) Linear Regression. 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 average value of a continuous target. C) The input features for a new data point. 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) The name of the feature used for splitting. C) A random number. D) A categorical class label.
A) Interpretability; the model's decision-making process is easy to understand and visualize. B) Superior performance on all types of data compared to other algorithms. C) Immunity to overfitting on noisy datasets. D) Guarantee to find the global optimum for any dataset.
A) Grow a tree structure by making sequential decisions. B) Perform linear regression more efficiently. 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) All data points in the training set. D) The axes of the original feature space.
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) Dimensionality reduction. C) Training or model fitting. D) Data preprocessing.
A) The data is always too small. B) There are no ground truth labels to compare the results against. C) The models are always less accurate than supervised models. D) The algorithms are not well-defined.
A) Dimensionality Reduction techniques like Principal Component Analysis (PCA). B) A Regression algorithm like Linear Regression. C) A Classification algorithm like Logistic Regression. D) An Association rule learning algorithm.
A) Classification, a supervised learning method. B) Clustering, an unsupervised learning method. C) Regression, 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) Loss function. D) Activation function.
A) The identity function (f(x) = x). B) The mean squared error function. C) A constant function. D) Rectified Linear Unit (ReLU).
A) Manually setting the weights based on expert knowledge. B) Randomly assigning weights and never changing them. C) Clustering the input data. D) Iteratively adjusting the weights and biases to minimize a loss function.
A) Initialize the weights before training. 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) Perform clustering on the output layer. D) Visualize the network's architecture.
A) Decision trees with a single split. B) Neural networks with many layers (hence "deep"). C) K-means clustering exclusively. D) Simple linear regression models.
A) Always train faster and with less data. B) Operate without any need for data preprocessing. C) Automatically learn hierarchical feature representations from data. D) Be perfectly interpretable, like a decision tree.
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) Detect local features (like edges or textures) in the input by applying a set of learnable filters. B) Initialize the weights of the network. C) Flatten the input into a single vector. D) Perform the final classification.
A) Sequential data, like time series or text, due to their internal "memory" of previous inputs. B) Static, non-temporal data. C) Only image data. D) Independent and identically distributed (IID) data points.
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) Fit the model's parameters (e.g., the weights in a neural network). B) Deploy the model in a production environment. C) Tune the model's hyperparameters. D) Provide an unbiased evaluation of a final model's performance.
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) Used repeatedly to tune the model's hyperparameters. B) Used as part of the training data to improve accuracy. C) Ignored in the machine learning pipeline. D) Used only once, for a final evaluation of the model's performance on unseen data after model development is complete.
A) Fails to learn the underlying pattern in the training data. B) Learns the training data too well, including its noise and outliers, and performs poorly on new, unseen data. C) Is evaluated using the training set instead of a test set. D) Is too simple to capture the trends in the data.
A) Training for more epochs without any checks. B) Dropout, which randomly ignores a subset of neurons during training. C) Increasing the model's capacity by adding more layers. D) Using a smaller training dataset.
A) The activation function used in the output layer. B) The weights connecting the input layer to the hidden 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 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) Bias and variance can be minimized to zero simultaneously. B) Only variance is important for model performance. C) Only bias is important for model performance. D) Decreasing bias will typically increase variance, and vice versa. The goal is to find a balance.
A) Overfitting. B) Underfitting. C) A well-generalized model. D) Perfect model performance.
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 number of layers in the network. D) The speed of the backpropagation algorithm.
A) Is only used for unsupervised learning. B) Randomly searches the parameter space for a good solution. C) Guarantees finding the global minimum for any loss function. D) Iteratively adjusts parameters in the direction that reduces the loss function.
A) The number of layers in a neural network. B) The activation function for the output layer. 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) A type of regularization technique. B) One complete pass of the entire training dataset through the learning algorithm. C) The processing of a single training example. D) The final evaluation on the test set.
A) The number of layers in the network. B) The number of validation examples. C) The number of training examples used in one forward/backward pass before the model's parameters are updated. D) The total number of examples in the training set.
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. |