A) The data is generated randomly by the algorithm. B) The data is generated randomly by the algorithm. C) The data is unlabeled, and the model must find patterns on its own. D) The @data is labeled, meaning each example is paired with a target output.
A) Memorize the entire training dataset perfectly. B) Discover hidden patterns without any guidance. C) Reduce the dimensionality of the input data for visualization. D) Gen@eralize 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) Predicting the selling price of a house based on its features. C) Diagnosing @a tumor as malignant or benign based on medical images. D) Estimating the annual revenue of a company.
A) Clustering problem. B) Dimensionality reduction problem. C) Regressio@n problem. D) Classification problem.
A) To achieve perfect accuracy on a held-out test set. B) To predict a target variable based on labeled examples. C) To @discover the inherent structure, patterns, or relationships within unlabeled data. D) To classify emails into spam and non-spam folders.
A) Classification. B) C@lustering. C) Reinforcement Learning. D) Regression.
A) A support vector machine for classification. B) Linear Regression, a type of supervised learning. C) Logistic Regression, a type of supervised learning. D) Clu@stering, a type of unsupervised 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) Deep learning with neural networks. B) Regression in supervised learning. C) Ass@ociation rule learning in unsupervised learning. D) Classification in supervised learning.
A) It requires no labeled data at all. B) It is simpler to implement than unsupervised learning. C) It is always more accurate than fully supervised learning. D) La@beling data is often expensive and time-consuming, so it leverages a small labeled set with a large unlabeled set.
A) "Which category?" B) "Is this pattern anomalous?" C) "What is the underlying group?" D) "H@ow much?" or "How many?"
A) "How can I reduce the number of features?" B) "What is the correlation between these variables?" C) "How much?" or "How many?" D) "Whic@h category?" or "What class?"
A) Lin@ear Regression B) k-Nearest Neighbors for classification C) Decision Tree for classification D) Logistic Regression
A) Mult@i-class classification B) Clustering C) Regression D) Dimensionality reduction
A) The input features for a new data point B) The average value of a continuous target C) The probability of moving to the next node D) Th@e final class labels or decisions
A) A c@ontinuous 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) Guarantee to find the global optimum for any dataset B) Inter@pretability; the model's decision-making process is easy to understand and visualize C) Immunity to overfitting on noisy datasets D) Superior performance on all types of data compared to other algorithms
A) Perform linear regression more efficiently B) Initialize the weights of a neural network C) Grow a tree structure by making sequential decisions D) Fin@d a linear separating hyperplane in a high-dimensional feature space, even when the data is not linearly separable in the original space
A) . Da@ta points that are closest to the decision boundary and most critical for defining the optimal hyperplane B) The axes of the original feature space C) All data points in the training set D) The weights of a neural network layer
A) Their lower computational cost for very large datasets B) Their superior interpretability and simplicity C) Their inherent resistance to any form of overfitting D) The@ir effectiveness in high-dimensional spaces and their ability to model complex, non-linear decision boundaries
A) Clustering B) Dimensionality reduction C) Tr@aining or model fitting D) Data preprocessing
A) There@ are no ground truth labels to compare the results against B) The algorithms are not well-defined C) The data is always too small D) The models are always less accurate than supervised models
A) An Association rule learning algorithm B) Dimen@sionality Reduction techniques like Principal Component Analysis (PCA) C) A Classification algorithm like Logistic Regression D) A Regression algorithm like Linear Regression
A) Classification, a supervised learning method B) Clus@tering, an unsupervised learning method C) A neural network for image recognition D) Regression, a supervised learning method
A) Artifi@cial neuron or perceptron, which receives inputs, applies a transformation, and produces an output B) Support vector C) Decision node in a tree D) Principal component
A) Activ@ation function B) Loss function C) Kernel function D) Optimization algorithm
A) A constant function B) The mean squared error function C) The identity function (f(x) = x) D) Rectifie@d Linear Unit (ReLU)
A) Manually setting the weights based on expert knowledge B) Iterativ@ely adjusting the weights and biases to minimize a loss function C) Randomly assigning weights and never changing them D) Clustering the input data
A) Perform clustering on the output layer B) Visualize the network's architecture 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) Initialize the weights before training
A) Neural n@etworks with many layers (hence "deep") B) K-means clustering exclusively C) Decision trees with a single split D) Simple linear regression models
A) Auto@matically learn hi@erarchical feature representations from data B) Always train faster and with less data C) Be perfectly interpretable, like a decision tree D) Operate without any need for data preprocessing
A) Unsupervised clustering of audio signals B) Text data and natural language processing C) Tabular data with many categorical features D) Image @data, due to their architecture which exploits spatial locality
A) Perform the final classification B) Initialize the weights of the network C) Flatten the input into a single vector D) Detect@ local features (like edges or textures) in the input by applying a set of learnable filters
A) Independent and identically distributed (IID) data points B) Static, non-temporal data C) Only image data D) Sequ@ential 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 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) Tune the model's hyperparameters B) Deploy the model in a production environment C) Provide an unbiased evaluation of a final model's performance D) Fit th@e model's parameters (e.g., the weights in a neural network)
A) Tun@ing hyperparameters and making decisions about the model architecture during development B) The initial training of the model's weights C) Data preprocessing and cleaning D) The final, unbiased assessment of the model's generalization error
A) Use@d only once, for a final evaluation of the model's performance on unseen data after model development is complete B) Used repeatedly to tune the model's hyperparameters C) Used repeatedly to tune the model's hyperparameters D) Ignored in the machine learning pipeline
A) Learns @the training data too well, including its noise and outliers, and performs poorly on new, unseen data B) Is evaluated using the training set instead of a test set C) Fails to learn the underlying pattern in the training data D) Is too simple to capture the trends in the data
A) Training for more epochs without any checks B) Increasing the model's capacity by adding more layers C) Dropo@ut, which randomly ignores a subset of neurons during training D) Using a smaller training dataset
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 speed at which the model trains B) The er@ror 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 intercept term in a linear regression model
A) Only variance is important for model performance B) Only bias is important for model performance C) Decrea@sing bias will typically increase variance, and vice versa. The goal is to find a balance D) Bias and variance can be minimized to zero simultaneously
A) Perfect model performance B) Overf@itting C) Underfitting D) A well-generalized model
A) The speed of the backpropagation algorithm B) The number of layers in the network 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) 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 amount of training data used in each epoch B) The activation function for the output layer 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 number of layers in a neural network
A) One complete pass of the entire training dataset through the learning algorithm B) The processing of a single training example C) A type of regularization technique D) The final evaluation on the test set
A) The number of validation examples B) The number of layers in the network C) The total number of examples in the training set 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) 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) 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) 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) 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) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm
A) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm
A) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm
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) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm
A) The processing of a single training example B) One complete pass of the entire training dataset through the learning algorithm |