Algorithm Selection as a Design Choice
This module teaches learners that choosing an algorithm is a design decision, not a race through a menu of model names.
Browser lab plus download fallbackRead the lessons, open the module notebook in the browser lab when available, and keep the downloadable pack for a local copy. Write the algorithm decision evidence before chasing scores.
Notebook options
Use the browser lab for quick practice, or extract the ZIP and open modules/module-01/notebooks/module-01-planning-notebook.ipynb locally. The downloadable pack remains the fallback if browser storage, network, or device limits interrupt the lab.
Module sequence
- Why the Best Model Depends on the ProblemUnit 1 · 25-35 minutes
- Data Size, Feature Type, Noise, Missingness, and DimensionalityUnit 2 · 30-40 minutes
- Interpretability, Speed, Maintenance, and Decision CostUnit 3 · 25-35 minutes
- Baseline Ladder: Dummy, Simple, Interpretable, ComplexUnit 4 · 30-40 minutes
- Experimental Protocol for Algorithm ComparisonUnit 5 · 30-45 minutes
- Project Step: Algorithm Candidate PlanUnit 6 · 35-50 minutes
- Activity: Create an Algorithm Candidate PlanPractice activity · 45-70 minutes
- Module 1 Assessment: Algorithm Selection ReadinessModule check · 30-45 minutes