Objectives
Provide knowledge of both theoretical and practical aspects of machine learning. Present the main techniques of machine learning and probabilistic reasoning.
Prerequisites
Linear algebra, probability theory (briefly revised during the course). Boolean algebra, knowledge of a programming language. For a good introduction to linear algebra see: Gilbert Strang, Introduction to Linear Algebra, Wellesley-Cambridge Press, 2016.
Content
Introduction to machine learning: designing a machine learning system, learning settings and tasks, decision trees, k-nearest-neighbour estimation. Mathematical foundations: linear algebra, probability theory, statistical tests. Maximum likelihood and Bayesian parameter estimation. Probabilistic graphical models: formalization, parameters and structure learning. Discriminative learning: linear discriminant functions, support vector machines, kernel machines. Neural networks: representation learning, deep architectures. Ensemble methods. Unsupervised and reinforcement learning.
Slides
- Introductionslides handouts
- Decision Treesslides handouts
- K-nearest neighboursslides handouts
- Linear algebraslides handouts
- Probability theoryslides handouts
- Evaluationslides handouts
- Parameter estimationslides handouts
- Bayesian Networksslides handouts
- Learning BNslides handouts
- Naive Bayesslides handouts
- Bayesian Network labslides data software
- Linear discriminant functionsslides handouts
- Support Vector Machinesslides handouts
- Kernel Machinesslides handouts
- Scikit-learn labslides repository
- Artificial Neural Networksslideshandouts
- Artificial Neural Networks labrepository
- Ensemble Methodsslides handouts
- Unsupervised learningslides handouts
- Unsupervised learning labrepository
- Reinforcement learningslides handouts
- Reinforcement learning labrepository