IAPR

 Suggested Syllabi for Courses on Machine Learning




The suggested syllabi is a result of surveying a broad selection of courses related to various aspects of machine learning from a number of different universities worldwide. Three courses with different lengths (short, medium and long) at two levels (undergraduate and postgraduate) are suggested. Although proposing a general syllabus for a machine learning course to cover various topics, which may needs different prerequisites, is nontrivial, hopefully the presented modules will help academics to prepare suitable course content more easily and faster.

                 
  Overview Courses   Postgraduate Course  
  Short Medium Long    Short Medium Long   
Total Hours 10 hrs 20 hrs 40 hrs   10 hrs 20 hrs 40 hrs  
Fundamentals124 122.5 
Introduction/Motivation0.250.51 0.250.50.5 
Basic Probability Theory0.250.250.75 000 
Basic Linear Algebra00.250.5 000 
Gaussian Distribution00.250.5 0.250.50.5 
Other Important Distributions00.250.5 0.250.50.5 
Bayesian Decision Theory0.50.50.5 0.250.250.5 
Information Theory000.25 00.250.5 
Feature Extraction12.53.5 126 
Preprocessing/Normalisation0.250.250.25 000.25 
Dimensionality Reduction0.751.751.75 122.75 
Independent Component Analysis000.5 001 
Factor Analysis000 001 
Feature Selection00.51 001 
Clustering123 11.752 
K-Means0.50.50.5 0.250.250.25 
Hierarchical Clustering00.50.5 0.250.250.25 
Spectral/Graph-based Clustering001 00.751 
Gaussian Mixture Models0.511 0.50.50.5 
Nonparametric Density Estimation11.51.5 0.51.51.5 
Histograms0.250.250.25 000 
Kernel Density Estimation/Parzen Windows0.250.50.5 0.250.250.25 
Nearest Neighbour Density Estimation0.50.750.75 0.250.250.25 
Bayesian Nonparametric Methods000 011 
Regression122 112 
Linear Regression111 0.50.50.5 
Linearly Weighted Basis Functions00.50.5 0.250.250.25 
Kernel Regression00.50.5 0.250.250.25 
Gaussian Processes000 001 
Classifiers3610 3.255.258 
Linear Discriminants11.52 111 
Logistic Regression001 111 
Support Vector Machines, Kernel Methods012 112 
Neural Networks (MLP, RBF)012 012 
Decision Trees111 00.51 
Naïve Bayes0.511 00.50.5 
Nearest Neighbour Classification0.50.51 0.250.250.5 
Parameter Estimation1.534 1.51.54 
Maximum Likelihood0.511 0.250.250.5 
Maximum A Posteriori011 0.750.751 
Expectation Maximisation111 0.50.50.5 
Sampling Methods001 001 
Variational Methods000 001 
Model Selection0.513 0.7511.5 
Overfitting, Train-vs-Test Error0.250.250.5 0.2500 
Bias-vs-Variance Dilemma00.51 0.250.50.5 
Regularization, Bayesian Model Selection001 0.250.51 
Cross Validation0.250.250.5 000 
Classifier Combination002 011 
Boosting001.5 00.250.25 
Bagging/Bootstrap000.5 00.750.75 
Other Combination Techniques000 000 
Graphical Models003 014 
Bayesian Belief Networks001 00.51 
Parameter Estimation001 000.5 
Markov Random Fields000 001 
Inference in Graphical Models001 00.51 
Structure Learning000 000.5 
Sequence Models002 013.5 
Markov Chains001 00.250.5 
Hidden Markov Models001 00.752 
Linear Dynamical Systems000 001 
Theoretical Concepts001 012 
PAC Learning000.5 00.750.75 
VC Dimension000.5 00.250.25 
Computational Learning Theory000 001 
Other Types of Learning001 002 
Reinforcement Learning001 001 
Semi-supervised Learning000 000.5 
Active Learning000 000.5 

Return to Courses on Machine Learning
Return to Educators' Curricula page

Date of last change to this page: 06/17/2010 15:32:01
Valid HTML 4.01! © 2010 Robert Fisher