beginner
KNN & Decision Trees
Instance-based and tree-based learners — no parameters, pure geometry and information theory.
Distance MetricsCurse of DimensionalityInformation GainGini ImpurityPruning
ML project loop2/6 stages →
DataHypothesis spaceObjectiveOptimizationEvaluationDeployment feedback
4 lessons
01K-Nearest Neighbors
The simplest ML algorithm — classify by majority vote of nearby points.
Concept14m
02Decision Trees
Splitting data like 20 questions — Gini impurity, information gain, and pruning.
Concept16m
03The Bias–Variance Tradeoff
Why every model choice is a bet between being too rigid and too jumpy — seen through k and tree depth.
Concept10m
04KNN & Decision Trees Quiz
Test your understanding of nearest neighbors, entropy, Gini impurity, and overfitting.
Quiz10m