A) The data is unlabeled, and the model must find patterns on its own B) The data is generated randomly by the algorithm. C) The data is always image-based. D) The data is labeled, meaning each example is paired with a target output.
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 model's parameters. B) The loss function C) The input features. D) The label or target output.
A) Predicting the selling price of a house based on its features. B) Diagnosing a tumor as malignant or benign based on medical images. C) Estimating the annual revenue of a company. D) Forecasting the temperature for tomorrow.
A) Classification problem B) Regression problem. C) Dimensionality reduction problem D) Clustering problem.
A) To discover the inherent structure, patterns, or relationships within unlabeled data. B) To classify emails into spam and non-spam folders C) To achieve perfect accuracy on a held-out test set. D) To predict a target variable based on labeled examples
A) Clustering B) Classification C) Reinforcement Learning. D) Regression
A) Linear Regression, a type of supervised learning. B) Clustering, a type of unsupervised learning. C) Logistic Regression, a type of supervised learning. D) A support vector machine for classification.
A) Increase the number of features to improve model accuracy. B) Predict a continuous output variable. C) Assign categorical labels to each data point. D) Reduce the number of features while preserving the most important information in the data.
A) Association rule learning in unsupervised learning. B) Regression in supervised learning. C) Classification 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 requires no labeled data at all. C) It is always more accurate than fully supervised learning. D) It is simpler to implement than unsupervised learning.
A) "Is this pattern anomalous?" B) "Which category?" C) "What is the underlying group?" D) "How much?" or "How many?"
A) "Which category?" or "What class?" B) "How can I reduce the number of features?" C) "What is the correlation between these variables?" D) "How much?" or "How many?"
A) Linear Regression. B) k-Nearest Neighbors for classification. C) Decision Tree for classification. D) Logistic Regression.
A) Dimensionality reduction. B) Clustering. C) Regression. D) Multi-class classification.
A) The probability of moving to the next node. B) The input features for a new data point. C) The average value of a continuous target. 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) A random number. C) A categorical class label. D) The name of the feature used for splitting.
A) Interpretability; the model's decision-making process is easy to understand and visualize. B) Immunity to overfitting on noisy datasets. 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) Grow a tree structure by making sequential decisions. C) Find a linear separating hyperplane in a high-dimensional feature space, even when the data is not linearly separable in the original space. D) Initialize the weights of a neural network.
A) The weights of a neural network layer. B) All data points in the training set. C) Data points that are closest to the decision boundary and most critical for defining the optimal hyperplane. 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 superior interpretability and simplicity. C) Their inherent resistance to any form of overfitting. D) Their lower computational cost for very large datasets.
A) Dimensionality reduction. B) Training or model fitting. C) Clustering. D) Data preprocessing.
A) The algorithms are not well-defined. B) The data is always too small. C) There are no ground truth labels to compare the results against. D) The models are always less accurate than supervised models.
A) A Regression algorithm like Linear Regression. B) A Classification algorithm like Logistic Regression. C) An Association rule learning algorithm. D) Dimensionality Reduction techniques like Principal Component Analysis (PCA).
A) A neural network for image recognition. B) Classification, a supervised learning method. C) Regression, a supervised learning method. D) Clustering, an unsupervised learning method.
A) Artificial neuron or perceptron, which receives inputs, applies a transformation, and produces an output. B) Principal component. C) Decision node in a tree. D) Support vector.
A) Kernel function. B) Activation function. C) Loss function. D) Optimization algorithm.
A) The identity function (f(x) = x). B) A constant function. C) Rectified Linear Unit (ReLU). D) The mean squared error function.
A) Randomly assigning weights and never changing them. B) Manually setting the weights based on expert knowledge. C) Clustering the input data. D) Iteratively adjusting the weights and biases to minimize a loss function.
A) Perform clustering on the output layer. 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) Initialize the weights before training. D) Visualize the network's architecture.
A) Simple linear regression models. B) K-means clustering exclusively. C) Neural networks with many layers (hence "deep"). D) Decision trees with a single split.
A) Be perfectly interpretable, like a decision tree. B) Operate without any need for data preprocessing. 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) Tabular data with many categorical features. C) Unsupervised clustering of audio signals. D) Text data and natural language processing.
A) Perform the final classification. B) Detect local features (like edges or textures) in the input by applying a set of learnable filters. C) Initialize the weights of the network. D) Flatten the input into a single vector.
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 too large and causing numerical instability. B) The gradients becoming exceedingly small as they are backpropagated through many layers, which can halt learning in early layers. C) The loss function reaching a perfect value of zero. D) The model overfitting to the training data.
A) Deploy the model in a production environment. B) Tune the model's hyperparameters. C) Provide an unbiased evaluation of a final model's performance. D) Fit the model's parameters (e.g., the weights in a neural network).
A) The initial training of the model's weights. B) Data preprocessing and cleaning. C) The final, unbiased assessment of the model's generalization error. D) Tuning hyperparameters and making decisions about the model architecture during development.
A) Used only once, for a final evaluation of the model's performance on unseen data after model development is complete. B) Ignored in the machine learning pipeline. C) Used as part of the training data to improve accuracy. D) Used repeatedly to tune the model's hyperparameters.
A) Is too simple to capture the trends in the data. 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 evaluated using the training set instead of a test set.
A) Training for more epochs without any checks. B) Dropout, which randomly ignores a subset of neurons during training. C) Using a smaller training dataset. D) Increasing the model's capacity by adding more layers.
A) The error from erroneous assumptions in the learning algorithm, leading to underfitting. B) The activation function used in the output layer. C) The error from sensitivity to small fluctuations in the training set, leading to overfitting. D) The weights connecting the input layer to the hidden layer.
A) The speed at which the model trains. B) The intercept term in a linear regression model. C) The error from sensitivity to small fluctuations in the training set, leading to overfitting. 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) Bias and variance can be minimized to zero simultaneously. C) Only variance is important for model performance. D) Only bias is important for model performance.
A) Overfitting. B) Underfitting. C) A well-generalized model. D) Perfect model performance.
A) The number of layers in the network. B) The speed of the backpropagation algorithm. C) How well the model is performing on the training data; it's the quantity we want to minimize during training. D) The accuracy on the test set.
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 activation function for the output layer. B) The number of layers in a neural network. 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 amount of training data used in each epoch.
A) The final evaluation on the test set. B) The processing of a single training example. C) One complete pass of the entire training dataset through the learning algorithm. D) A type of regularization technique.
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) 1, meaning the parameters are updated after each individual training example. B) The entire training set. C) A random number between 1 and 100. D) Exactly 50% of the training set. |