A) The @data is labeled, meaning each example is paired with a target output. B) The data is unlabeled, and the model must find patterns on its own. C) The data is generated randomly by the algorithm. D) The data is generated randomly by the algorithm.
A) Memorize the entire training dataset perfectly. B) Discover hidden patterns without any guidance. C) Gen@eralize from the training data to make accurate predictions on new, unseen data. D) Reduce the dimensionality of the input data for visualization.
A) The@ label or target output. B) The input features. C) The loss function. D) The model's parameters.
A) Predicting the selling price of a house based on its features. B) Forecasting the temperature for tomorrow. C) Estimating the annual revenue of a company. D) Diagnosing @a tumor as malignant or benign based on medical images.
A) Clustering problem. B) Classification problem. C) Regressio@n problem. D) Dimensionality reduction 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) C@lustering. B) Classification. C) Reinforcement Learning. D) Regression.
A) Linear Regression, a type of supervised learning. B) Clu@stering, a type of unsupervised learning. C) A support vector machine for classification. D) Logistic Regression, a type of supervised learning.
A) Increase the number of features to improve model accuracy. B) Re@duce the number of features while preserving the most important information in the data. C) Predict a continuous output variable. D) Assign categorical labels to each data point.
A) Classification in supervised learning. B) Deep learning with neural networks. C) Regression in supervised learning. D) Ass@ociation rule learning in unsupervised learning.
A) It requires no labeled data at all. B) La@beling data is often expensive and time-consuming, so it leverages a small labeled set with a large unlabeled set. C) It is simpler to implement than unsupervised learning. 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) "H@ow much?" or "How many?"
A) "What is the correlation between these variables?" B) "Whic@h category?" or "What class?" C) "How much?" or "How many?" D) "How can I reduce the number of features?"
A) Lin@ear Regression B) k-Nearest Neighbors for classification C) Decision Tree for classification D) Logistic Regression
A) Clustering B) Regression C) Mult@i-class classification D) Dimensionality reduction
A) The probability of moving to the next node B) Th@e final class labels or decisions C) The average value of a continuous target D) The input features for a new data point
A) The name of the feature used for splitting B) A random number C) A categorical class label D) A c@ontinuous value, often the mean of the target values of the training instances that reach the leaf
A) Superior performance on all types of data compared to other algorithms B) Immunity to overfitting on noisy datasets C) Inter@pretability; the model's decision-making process is easy to understand and visualize D) Guarantee to find the global optimum for any dataset
A) Initialize the weights of a neural network B) Fin@d a linear separating hyperplane in a high-dimensional feature space, even when the data is not linearly separable in the original space C) Perform linear regression more efficiently D) Grow a tree structure by making sequential decisions
A) The axes of the original feature space B) . Da@ta 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) All data points in the training set
A) Their inherent resistance to any form of overfitting B) Their superior interpretability and simplicity C) Their lower computational cost for very large datasets D) The@ir effectiveness in high-dimensional spaces and their ability to model complex, non-linear decision boundaries
A) Dimensionality reduction B) Clustering C) Tr@aining or model fitting D) Data preprocessing
A) The models are always less accurate than supervised models B) The data is always too small C) There@ are no ground truth labels to compare the results against D) The algorithms are not well-defined
A) An Association rule learning algorithm B) A Regression algorithm like Linear Regression C) Dimen@sionality Reduction techniques like Principal Component Analysis (PCA) D) A Classification algorithm like Logistic Regression
A) Classification, a supervised learning method B) A neural network for image recognition C) Regression, a supervised learning method D) Clus@tering, an unsupervised learning method
A) Support vector B) Artifi@cial neuron or perceptron, which receives inputs, applies a transformation, and produces an output C) Principal component D) Decision node in a tree
A) Loss function B) Activ@ation function C) Optimization algorithm D) Kernel function
A) The identity function (f(x) = x) B) A constant function C) Rectifie@d 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) Iterativ@ely adjusting the weights and biases to minimize a loss function
A) Perform clustering on the output layer B) Initialize the weights before training C) Efficient@ly calculate the gradient of the loss function with respect to all the weights in the network, enabling the use of gradient descent D) Visualize the network's architecture
A) K-means clustering exclusively B) Decision trees with a single split C) Neural n@etworks with many layers (hence "deep") D) Simple linear regression models
A) Be perfectly interpretable, like a decision tree B) Auto@matically learn hi@erarchical feature representations from data C) Operate without any need for data preprocessing D) Always train faster and with less data
A) Image @data, due to their architecture which exploits spatial locality B) Text data and natural language processing C) Tabular data with many categorical features D) Unsupervised clustering of audio signals
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) Only image data B) Independent and identically distributed (IID) data points C) Static, non-temporal data D) Sequ@ential data, like time series or text, due to their internal "memory" of previous inputs
A) The model overfitting to the training data 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 gradients becoming too large and causing numerical instability
A) Provide an unbiased evaluation of a final model's performance B) Tune the model's hyperparameters C) Fit th@e model's parameters (e.g., the weights in a neural network) D) Deploy the model in a production environment
A) Data preprocessing and cleaning B) The initial training of the model's weights C) The final, unbiased assessment of the model's generalization error D) Tun@ing hyperparameters and making decisions about the model architecture during development
A) Used repeatedly to tune the model's hyperparameters B) Use@d only once, for a final evaluation of the model's performance on unseen data after model development is complete C) Ignored in the machine learning pipeline D) Used repeatedly to tune the model's hyperparameters
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) Increasing the model's capacity by adding more layers B) Using a smaller training dataset C) Training for more epochs without any checks D) Dropo@ut, 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 erro@r from erroneous assumptions in the learning algorithm, leading to underfitting D) The weights connecting the input layer to the hidden layer
A) The er@ror 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) Decrea@sing 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) Overf@itting B) A well-generalized model C) Underfitting D) Perfect model performance
A) The number of layers in the network B) The speed of the backpropagation algorithm C) The accuracy on the test set D) How well the model is performing on the training data; it's the quantity we want to minimize during training
A) Iteratively adjusts parameters in the direction that reduces the loss function B) Randomly searches the parameter space for a good solution C) Guarantees finding the global minimum for any loss function D) Is only used for unsupervised learning
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 activation function for the output layer C) The number of layers in a neural network D) The amount of training data used in each epoch
A) The processing of a single training example B) A type of regularization technique C) The final evaluation on the test set D) One complete pass of the entire training dataset through the learning algorithm
A) The total number of examples in the training set B) The number of layers in the network C) The number of validation examples D) The number of training examples used in one forward/backward pass before the model's parameters are updated
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) One complete pass of the entire training dataset through the learning algorithm
A) One complete pass of the entire training dataset through the learning algorithm B) One complete pass of the entire training dataset through the learning algorithm
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example
A) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm |