..
2026-01-20 23:16:23 +07:00
2026-01-20 23:16:23 +07:00
2026-01-24 17:30:43 +07:00
2026-01-20 23:16:23 +07:00
2026-01-14 19:14:51 +07:00
2026-01-20 23:39:19 +07:00
2026-01-20 23:39:19 +07:00
Classification I
K-nearest neighbor classification
The objective is to study the use of the method k-nn and
- Select two datasets with labels.
- Run k-nn on these two datasets. Calculate the classification error (by comparing the class labels obtained with the prediction and the original labels of test data).
- Vary the value of k, comment on the results
- Try to normalize the input dataset, is the performance better?
- Apply PCA and SVD on the dataset, then what is the performance of k-nn on the new projected data? Justify the answer.
- Propose an approach to improve the performance of k-nn with the use of k-cross validation.
- Apply leave-one-out and calculate the error of classification.
SVM classifier
Suppose that we use the SVM classifier from sklearn in Python.
- Select two datasets with labels.
- Analyze the dataset. How is the data distribution? linearly separable or non-linearly seperable?
- Set up the SVM parameters suitable to the selected datasets.
- What is the performance of SVMs?
- How can SVM handle multi-class datasets?