Machine Learning¶
- Supervised Learning
- Unsupervised Learning
- Python for Data Analysis
- The Discipline of Machine Learning
- Weka Commands
- Reading List
- Bayesian Inference
- Bayesian Learning
- Beautiful Probability
- Comp Learning Theory
- Decision Trees
- Supervised Learning — Classification vs Regression
- Classification vs Regression
- Key Terminology
- Classification Learning — Worked Example
- Contingency Tables
- Data Mining & Information Theory
- Learning Decision Trees
- Dating Example — Problem Setup
- Decision Tree Representation
- Representation Quiz — Tracing Instances
- Best Attribute
- Decision Tree Expressiveness
- ID3 Algorithm
- ID3 Inductive Bias
- Continuous Attributes
- Other Considerations
- Regression Trees
- Regression vs Classification Trees
- Basic Decision Tree — Quick Reference
- Summary
- References
- Ensemble Learning: Boosting and Bagging
- Instance Based Learning
- Kernel Methods and SVM
- Neural Networks
- Overview
- Perceptron Unit
- Perceptron = Half-Plane
- Boolean Functions via Perceptrons
- XOR Requires a Network
- Perceptron Training
- Gradient Descent (Delta Rule)
- Comparison of Learning Rules
- Sigmoid Activation
- Neural Network Architecture
- Optimizing Weights & Overfitting
- Restriction Bias
- Preference Bias
- Neural Nets vs Other Supervised Learners
- Perceptron vs Sigmoid — Comparison
- Summary
- Regression
- VC Dimensions
- Which Hypothesis Spaces are Infinite
- Maybe It Is Not So Bad
- Power of Hypothesis Space
- What Does VC Stand For?
- Quiz: Intervals on the Real Line
- Quiz: Linear Separators in \(\mathbb{R}^2\)
- Quiz: Convex Polygons in \(\mathbb{R}^2\)
- Sample Complexity
- VC Dimension of Finite Hypothesis Classes
- Intervals: Proof Checklist
- Linear Separators: Additional Arguments
- Convex Polygons: VC = ∞
- Connecting to Original Sample Bound
- Summary