Interpretability of Classic Models

Algorithm Selection and Trade-offs

Multi-Class Classification Strategies

Linear vs Non-Linear Decision Boundaries

Parametric vs Non-Parametric Algorithms

L1 and L2 Regularization Basics

The Kernel Trick Explained

Support Vector Machines and Margins

Naive Bayes Independence Assumption

Naive Bayes Classifier

K-Nearest Neighbors Algorithm

Sigmoid and Decision Boundaries

Logistic Regression for Classification

Cost Function and Least Squares

Linear Regression: Model and Assumptions

Decision Tree Pruning

Boosting Concept

Gini and Entropy Impurity

SVM and Margins

Assumptions of Linear Regression

Polynomial Regression

Choosing K and Distance Metrics

OLS and Cost Function

Feature Importance from Trees

Logistic Regression and Sigmoid

Multiclass Strategies

Algorithm Selection Trade-offs

Ensemble Methods Overview

The Kernel Trick

Parametric vs Non-Parametric

Soft Margin and C Parameter

Decision Boundaries in Classification

Linear vs Non-Linear Models

Naive Bayes Classifier

Random Forests and Bagging

Ridge Regularization (L2)

Naive Bayes Independence Assumption

Decision Tree Splitting

Lasso (L1) and Feature Selection

Elastic Net Regularization

K-Nearest Neighbors Algorithm

Linear Regression Fundamentals

Multiclass Strategies: OvR vs OvO

Choosing an Algorithm for a Problem

Lazy vs Eager Learning

Assumptions of Linear Regression

Parametric vs Non-Parametric Models

Polynomial Regression

Linear vs Non-Linear Models

Regularization: L1 and L2

Decision Boundary

Margin and Support Vectors

Sigmoid and Log-Odds

Bayes Theorem and Independence

Support Vector Machines

Naive Bayes Classifier

Linear Regression Basics

The Kernel Trick

Choosing K in KNN

Logistic Regression Basics

K-Nearest Neighbors