Skip to content

Lessons

Introduction to Machine Learning: all lessons

From what supervised learning is, to SHAP, K-means, recommenders and forecasting.

12 modules · 21 lessons · 1 free to read now

About this track: outcomes, tools and price

Module 1Getting Started

2 lessons

Three kinds of learning, and the two data distinctions that drive almost every later decision.

  1. What separates the three is not the algorithm but the shape of the feedback available. One question, and its answer decides everything else.

    Free · read nowRead the lesson Simulation inside
  2. Categorical vs Numerical, Structured vs Unstructured

    14 min

    Two distinctions that decide which algorithms are available and what preprocessing is mandatory.

    Included with the track Simulation inside

Before any algorithm. A bad split produces a beautiful number that lies.

  1. Splitting Data, and K-Fold

    18 min

    Why one split is not enough, and why k = 5 is nearly always the answer.

    Included with the track Simulation inside
  2. Data Leakage

    16 min

    The number-one cause of a model that shines on a laptop and fails in production. Three forms, and how to spot the symptom.

    Included with the track Simulation inside

How to train, how to measure with the right metric, and the one trade-off that explains nearly every model failure.

  1. Choosing the Right Metric

    18 min

    Accuracy is the default metric and is almost always wrong. Here is how to choose properly.

    Included with the track Simulation inside
  2. Bias–Variance Trade-off

    16 min

    One framework that explains underfitting, overfitting, and why more data sometimes does not help.

    Included with the track Simulation inside
  3. Hyperparameter Tuning

    14 min

    Grid search, random search, and why random search is nearly always better.

    Included with the track Simulation inside

The algorithm that learns nothing, and teaches a great deal precisely because of that.

  1. How KNN Decides

    16 min

    No training, no model. Only distance, and a k that decides everything.

    Included with the track Simulation inside

Find the boundary with the widest gap to both classes. Simple, and very strong in high dimensions.

  1. Margin, C, and Kernels

    20 min

    One geometric idea, one parameter that sets tolerance, and one trick that lets it curve.

    Included with the track Simulation inside

Module 6Linear Regression

1 lesson

The oldest model, the easiest to explain, and still a baseline that is hard to beat.

  1. Finding the Best Line

    18 min

    "Best" means the smallest sum of squared residuals. Why squares, and what follows from that.

    Included with the track Simulation inside

Module 7Logistic Regression

1 lesson

Called regression, does classification. And it outputs a probability, which is more useful than a class.

  1. Sigmoid, Log-Odds, and the Threshold

    18 min

    Why linear regression cannot do classification, and what the sigmoid changes.

    Included with the track Simulation inside

From one tree you can draw, to hundreds that win nearly every tabular competition.

  1. From One Tree to a Forest

    22 min

    One tree is easy to read and easy to overfit. Two ways to combine many, and why they differ.

    Included with the track Simulation inside

Module 9Feature Engineering

1 lesson

The work that most often decides the result, and is least often covered in tutorials.

  1. Building Features That Help

    20 min

    Encoding, transformation, date features, aggregation. Plus one warning about target encoding.

    Included with the track Simulation inside

Three tools answering three different questions. Using the wrong one gives a confidently wrong answer.

  1. Three Questions, Three Tools

    22 min

    Which features matter? What shape is the effect? Why was this applicant rejected? Three questions, and no single tool answers all three.

    Included with the track Simulation inside

Finding groups without labels with K-means, and condensing many columns into a few with PCA.

  1. Clustering with K-Means

    20 min

    Two steps on repeat — assign every point to its nearest centre, move each centre to the mean of its group — and you have the most widely used clustering algorithm.

    Included with the track Simulation inside
  2. Principal Component Analysis (PCA)

    20 min

    PCA finds the directions in which the data varies most and projects the data onto a few of them. Many correlated columns become a few uncorrelated components.

    Included with the track Simulation inside
  3. DBSCAN, Hierarchical Clustering and Gaussian Mixtures

    20 min

    Clustering for groups that are not round, and when to use each method.

    Included with the track Simulation inside

Module 12Recommendation Systems

4 lessons

Filling the blank cells of a user–item matrix three ways — demographic segments, item features, and similar neighbours — then measuring which one is right.

  1. What a Recommender Predicts

    18 min

    Every recommendation is a guess at one blank cell in a user–item matrix — and the easiest guess, the segment average, turns out to be hard to beat.

    Included with the track Simulation inside
  2. Content-Based Filtering

    18 min

    If you know what an item is made of, you can recommend it to people who liked similar items — even before anyone has rated it.

    Included with the track Simulation inside
  3. Collaborative Filtering

    22 min

    People who rated alike in the past will rate alike in the future — from that one assumption come user-based, item-based, and matrix factorisation.

    Included with the track Simulation inside
  4. Evaluating and Combining Recommenders

    20 min

    A smaller RMSE is not necessarily a better list: ranking metrics, A/B tests, hybrid strategies, and the popularity bias that quietly reinforces itself.

    Included with the track Simulation inside