Back to the lessonPreparing the printout…

Fundamental of Machine Learning · Module 2: Core Machine Learning Algorithms

Choosing an Algorithm: Assumptions and Use Cases

[markdown] content available only on the platform

[markdown] content available only on the platform

Flashcards · Choosing an Algorithm: Assumptions and Use Cases

Baseline — A simple first model (linear or logistic regression) that gives a reference score to beat.

LogisticRegression score 0.78 vs Random Forest 0.79.

Explainability requirement — A legal or business need to justify each prediction, which favours trees and linear models.

A bank must explain why a loan was rejected.

Non-linear relationship — A relationship where the output does not change in a straight-line way with the inputs.

A clear curve in a scatter plot.

Scaling requirement — Whether an algorithm needs features on the same scale: required for SVM, not needed for trees.

StandardScaler before SVC.

Outlier sensitivity — How strongly extreme values distort a model; high for linear regression, low for trees.

One mansion price pulls a regression line upward.

Scalability — How training time grows with data size; SVM slows noticeably at hundreds of thousands of rows.

Prefer trees or linear models for millions of rows.

Simplicity principle — If a complex model does not clearly beat the baseline, keep the simpler model.

Easier to deploy, maintain and explain.

Fundamental of Machine Learning · Choosing an Algorithm: Assumptions and Use Cases · printed on November 20, 2026