Looking for Machine Learning-(BSCS-2, BSDS-2) test answers and solutions? Browse our comprehensive collection of verified answers for Machine Learning-(BSCS-2, BSDS-2) at moodle.ucu.ac.ug.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
If a KNN model is trained on N samples with D features, what is the time complexity to classify a single new data point using the brute-force approach?
Decision Trees require feature scaling (normalisation or standardisation) to work correctly, just like KNN.
The KNN algorithm has a computationally expensive training phase where it builds an internal model of the data.
When evaluating a Decision Tree on a dataset with 5% positive and 95% negative examples, a student uses a random (non-stratified) train-test split. What risk does this introduce?
If a Decision Tree node contains 50 samples and all belong to class A, what is the entropy of that node?
In a Decision Tree, an attribute with an Information Gain of 0 means:
A KNN classifier with K=1 achieves 98% training accuracy but only 72% test accuracy. A KNN classifier with K=25 achieves 80% training accuracy and 79% test accuracy. What is the most accurate diagnosis?
A dataset has 50 positive and 50 negative examples. What is the entropy of this dataset?
Your KNN classifier has 50 features, but you suspect many are irrelevant and degrading performance. You need to design a feature selection strategy that works well with KNN. Which approach is most effective?
You test K = 1, 3, 5, 7, 9 using 5-fold cross-validation and get the following average accuracies: 89%, 92%, 94%, 93%, 88%. Which K should you select and why?