What are the advantages and limitations of using Bootstrapping in Machine Learning?
- Fast computation but lacks precision
- Reduced bias but increased computation complexity
- Robust statistical estimates but can introduce high variance
- Robust statistical estimates but may not always be appropriate for all data types
The advantages of Bootstrapping include robust statistical estimates, even with small samples, by resampling with replacement. However, it may not always be appropriate for all data types, especially if the underlying distribution of the data is not well represented by resampling. It provides valuable insights but needs to be applied considering the nature of the data and problem.
While R-Squared describes the proportion of variance explained by the model, ________ adjusts this value based on the number of predictors, providing a more nuanced understanding of the model's fit.
- Adjusted R-Squared
- MSE
- R-Squared
- RMSE
Adjusted R-Squared is an extension of R-Squared that adjusts the value based on the number of predictors in the model. While R-Squared describes the proportion of variance explained by the model, Adjusted R-Squared takes into account the complexity of the model by considering the number of predictors. This leads to a more nuanced understanding of the model's fit, particularly when comparing models with different numbers of predictors.
You are working on a binary classification problem, and your model is consistently predicting the majority class. What could be causing this issue and how would you approach resolving it?
- Data is corrupted; clean the data
- Ignoring the minority class; use resampling techniques
- Incorrect algorithm; change algorithm
- Too many features; perform feature selection
The issue could be due to imbalanced classes. Approaching it by using resampling techniques, such as oversampling the minority class or undersampling the majority class, can help balance the classes and improve the model's performance.
Explain the Bias-Variance tradeoff in the context of Cross-Validation.
- Increasing k decreases bias but may increase variance
- Increasing k decreases both bias and variance
- Increasing k increases bias but decreases variance
- Increasing k increases both bias and variance
The Bias-Variance tradeoff in the context of k-fold Cross-Validation refers to the balance between bias (error due to overly simplistic assumptions) and variance (error due to excessive complexity). Increasing k generally decreases bias since more data is used for training, but it may lead to an increase in variance as the validation set becomes more similar to the training set.
You're given a dataset with several features, some of which are highly correlated. How would you handle this using dimensionality reduction techniques?
- Applying K-Means Clustering
- Applying L1 Regularization
- Applying Principal Component Analysis (PCA)
- Applying Random Forest
Principal Component Analysis (PCA) would be used to handle high correlation among features. It reduces dimensionality by creating new uncorrelated variables that capture the variance present in the original features.
The addition of _________ in the loss function is a common technique to regularize the model and prevent overfitting.
- bias
- learning rate
- regularization terms
- weights
Regularization terms (like L1 or L2 penalties) in the loss function constrain the model, reducing the risk of overfitting by preventing large weights.
You have trained an SVM but the decision boundary is not fitting well to the data. How could adjusting the hyperplane parameters help?
- Change the kernel's color
- Increase the size of the hyperplane
- Modify the regularization parameter 'C'
- Reduce the number of support vectors
Adjusting the regularization parameter 'C' controls the trade-off between margin maximization and error minimization, helping to fit the decision boundary better.
Discuss the difference between Euclidean distance and Manhattan distance metrics in the context of KNN.
- Euclidean is faster, Manhattan is more accurate
- Euclidean is for 3D, Manhattan for 2D
- Euclidean is for continuous data, Manhattan for categorical
- Euclidean uses squares, Manhattan uses absolutes
Euclidean distance is the square root of the sum of squared differences, while Manhattan distance is the sum of the absolute differences.
A dataset with very high between-class variance but low within-class variance is given. How would the LDA approach be beneficial here?
- LDA would be the same as PCA
- LDA would perform optimally due to the variance characteristics
- LDA would perform poorly
- LDA would require transformation of the dataset
LDA would "perform optimally" in this scenario, as high between-class variance and low within-class variance align perfectly with its objective of maximizing between-class variance and minimizing within-class variance.
What is the risk of using the same data for both training and testing in a Machine Learning model?
- Increase in accuracy; Reduction in bias
- Increase in complexity; Reduction in training time
- Reduction in training time; Increase in bias
- Risk of overfitting; Unrealistic performance estimates
Using the same data for training and testing leads to the risk of overfitting and provides unrealistic performance estimates. The model will have seen all the data during training, so it might not generalize well to new, unseen instances.