Useful Links
Computer Science
Artificial Intelligence
Machine Learning
Supervised Learning
1. Foundations of Supervised Learning
2. The Supervised Learning Workflow
3. Linear Models
4. Tree-Based Models
5. Instance-Based Learning
6. Support Vector Machines
7. Probabilistic Models
8. Model Evaluation and Validation
9. Advanced Topics in Supervised Learning
10. Practical Implementation Considerations
Instance-Based Learning
K-Nearest Neighbors
Algorithm Overview
Training Phase Characteristics
Prediction Phase Process
Choosing the Value of K
Odd vs Even K Values
Bias-Variance Implications
Cross-validation for K Selection
Distance Metrics
Euclidean Distance
Mathematical Definition
Geometric Interpretation
Manhattan Distance
L1 Norm
City Block Distance
Minkowski Distance
Generalized Distance Metric
Parameter p Effects
Cosine Similarity
Hamming Distance
Custom Distance Measures
Weighted KNN
Distance-based Weighting
Inverse Distance Weighting
Computational Considerations
Time Complexity
Space Complexity
Curse of Dimensionality
Feature Scaling Importance
Impact of Different Scales
Normalization Strategies
Advantages and Limitations
Non-parametric Nature
Local Decision Boundaries
Computational Efficiency Issues
Sensitivity to Irrelevant Features
Previous
4. Tree-Based Models
Go to top
Next
6. Support Vector Machines