Algorithms for Machine Learnings
Classical machine learning algorithms are the standard model families for tabular data: linear and logistic regression, decision trees, random forests, gradient boosting, k-means clustering and PCA. This unit in the Classical Machine Learning stage explains what each model assumes, how it is trained and when it is the right first choice.
Stage: Classical Machine Learning · Part of the Machine Learning roadmap · Last reviewed 19 November 2026
What to learn in Algorithms
- Fit a linear regression and read its coefficients
- Train a logistic regression classifier and interpret predicted probabilities
- Explain how a decision tree splits and why deep trees overfit
- Compare random forests with gradient boosting for a tabular problem
- Cluster points with k-means and reduce dimensions with PCA
Algorithms interview questions
How does a random forest differ from a single decision tree?
A random forest trains many trees on bootstrap samples of the data, with each split considering a random subset of features, then averages or votes their predictions. This reduces variance and overfitting compared with one deep tree, at some cost in interpretability.
When would you use PCA?
Use PCA to reduce many correlated features to a few components that keep most of the variance, for visualisation, noise reduction or faster training. It is unsupervised and sensitive to feature scale, so standardise the data first.
Where Algorithms fits in the Machine Learning roadmap
Algorithms belongs to the Classical Machine Learning stage (beginner level), which takes about 5 hours. The workhorses.
Other units in this stage
Back to the full Machine Learning roadmap