Difference between revisions of "Pattern Analysis and Machine Intelligence"

Revision as of 08:26, 24 July 2013

The following are last minute news you should be aware of ;-)

24/07/2013: final grades for the 11/07/2013 exam
22/07/2013: at the following link you can find the grades for the homeworks and the 11/07/2013 exam
21/06/2013: fixed third homework publication ...
21/06/2013: the third homework is out! You have to turn it in before you take the exam (the first time).
17/06/2013: bug fix in the homework part 2, the online pdf is now updated
13/06/2013: update to the schedule with pointers to the relevant chapters
09/05/2013: second homework is out -> deadline to turn it in Sunday 23/06/2013
03/06/2013: no lecture on 11/06 it will be on 13/06/2013 from 15:15 to 18:15 in room V07
            update to the detailed schedule with previous change
            added file for Part 1 of Homework 1
28/05/2013: fixed file prostate.data for the homework
26/05/2013: first homework is out -> deadline to turn it in Sunday 09/06/2013
21/05/2013: detailed schedule updated
13/04/2013: change to the schedule to recover missed lecture
05/03/2013: a new edition of the course starts today!
05/03/2013: grades from the 29/01/2013 exam are available at this link

Course Aim & Organization

The objective of this course is to give an advanced presentation of the techniques most used in artificial intelligence and machine learning for pattern recognition, knowledge discovery, and data analysis/modeling.

Teachers

The course is composed by a blending of lectures and exercises by the course teacher and some teaching assistants.

• Matteo Matteucci: the course teacher
• Luigi Malago': the teaching assistant on regression
• Davide Eynard: the teaching assistant on clustering

Course Program

Techniques from machine and statistical learning are presented from a theoretical (i.e., statistics and information theory) and practical perspective through the descriptions of algorithms, the theory behind them, their implementation issues, and few examples from real applications. The course follows, at least partially, the outline of The Elements of Statistical Learning book (by Trevor Hastie, Robert Tibshirani, and Jerome Friedman):

• Machine Learning and Pattern Classification: in this part of the course the general concepts of Machine Learning and Patter Recognition are introduced with a brief review of statistics and information theory;
• Unsupervised Learning Techniques: the most common approaches to unsupervised learning are described mostly focusing on clustering techniques, rule induction, Bayesian networks and density estimators using mixure models;
• Supervised Learning Techniques: in this part of the course the most common techniques for Supervised Learning are described: decision trees, decision rules, Bayesian classifiers, hidden markov models, lazy learners, etc.
• Feature Selection and Reduction: techniques for data rediction and feature selection will be presented with theory and applications
• Model Validation and Selection: model validation and selection are orthogonal issues to previous technique; during the course the fundamentals are described and discussed (e.g., AIC, BIC, cross-validation, etc. ).

Detailed course schedule

A detailed schedule of the course can be found here; topics are just indicative while days and teachers are correct up to some last minute change (I will notify you by email). Please note that not all days we have lectures!!

(*) Linear regression methods (Ch 2.1, 2.2, 2.3 and 2.3.1, 2.4, 2.6 and 2.6.1, 2.7 and 2.7.1, 2.8 and 2.8.1, 3.1, 3.2, 3.3, 3.4, 3.5, 3.6, 3.9, see paper "Least Angle Regression" linked below, pages 1-16)

Course Evaluation

The course evaluation is composed by two parts:

• A homework with exercises covering the whole program that counts for 30% of the course grade
• A written examination covering the whole program that count for 70% of the course grade

The homework is just one per year, it will be published at the end of the course and you will have 15 days to turn it in. It is not mandatory, however if you do not turn it in you loose 30% of the course grade. There is the option of substitute the homework with a practical project, but this has to be discussed and agreed with the course professor.

Teaching Material (the textbook)

Lectures will be based on material taken from the aforementioned slides and from the following book.

• The Elements of Statistical Learning: Data Mining, Inference, and Prediction. by Trevor Hastie, Robert Tibshirani, and Jerome Friedman.

Some additional material that could be used to prepare the oral examination will be provided together with the past homeworks.

Teacher Slides

In the following you can find the lecture slides used by the teacher and the teaching assistants during classes:

• Course introduction: introductory slides of the course with useful information about the grading, and the course logistics. Some examples from supervised learning and two algorithms for classification (taken from The Elements of Statistical Learning book).
• Probability Basics: Slides on probability basics used to introduce Statistical Decision Theory.
• Linear Classification Examples: slides presenting images, tables and examples about (generalized) linear methods for classification (taken from The Elements of Statistical Learning book).
• Kernel Smoothing Examples: slides presenting images, tables and examples about Kernel Smoothing, Kernel Density Estimation and Gaussian Mixture Models (taken from The Elements of Statistical Learning book).
• Decision Trees and Classification Rules: these slides have been used to present decision trees and decision rules complementing the material in Ch. 9.2 of the The Elements of Statistical Learning book.
• Support Vector Machines: these slides have been used to present Support Vector Machines (taken from The Elements of Statistical Learning book).

Additional Papers

Papers used to integrate the textbook

• Bradley Efron, Trevor Hastie, Iain Johnstone and Robert Tibshirani, Least Angle Regression Annals of Statistics (with discussion) (2004) 32(2), 407-499.
• Burges, Christopher J. C., 1998. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2), 121–167.
• ...

Clustering Slides

These are the slides used to present clustering algorithms during lectures

• Lesson 1: Introduction to Clustering and K-Means (slides, handouts)

• Lesson 2: K-Means alternatives, Hierarchical, SOM (slides, handouts)

• Lesson 3: Mixture of Gaussians, DBSCAN, Jarvis-Patrick (slides, handouts)

• Lesson 4: Evaluation measures (slides, handouts) and Spectral Clustering ([1])

Past Exams and Sample Questions

These are the text of past exams to give and idea on what to expect during the class exam:

• 29/01/2013 Exam
• 19/09/2012 Exam
• 04/09/2012 Exam
• 10/07/2012 Exam
• 26/06/2012 Exam
• 03/02/2012 Exam
• 19/09/2011 Exam
• 08/09/2011 Exam
• 15/07/2011 Exam
• 29/06/2011 Exam

2013 Homework

The 2013 Homework (alike the 2012 one) is organized as an octave series of tutorials. You are requested to go through the tutorials and practice with the algorithms that have been presented in class. To prove us you have done it and that you have understood the code you will be requested to solve few exercises and provide us a pdf report by email

Part 1: Regression

• Homework 2013 Regression: this is the text of the first part of the homework; it has been intentionally edited not to allow cut and paste. This part of the homework will contribute to the 10% of the grade and the deadline to submit the solution by email to matteucci@elet.polimi.it and malago@di.unimi.it is Sunday 09/06 23:59
  • prostate.data: the dataset used for the homework
  • prostate.info: the dataset used for the homework
  • diabete.mat: the dataset used for the homework
  • textread.m: (optional) function which might be useful depending on your octave version
  • strread.m: (optional) function which might be useful depending on your octave version

For any question or doubt please sen us an email as soon as possible.

Note 1: for some strange reason the CSM of the website has decided to rename the files with capitals, please save them in lower case :-(

Note 2: rename the file Diabete.data into diabete.mat ... still fighting with the CSM :-)

Note 3: the code has been tested with octave under linux, we suggest to use it not to spend too much time with installing it under windows or using matlab. If you do not have linux installed, try using a live CD as the ubuntu 13.04 live distro ;-)

Part 2: Classification

• Homework 2013 Classification: this is the text of the second part of the homework; it has been intentionally edited not to allow cut and paste. This part of the homework will contribute to the 10% of the grade and the deadline to submit the solution by Sunday 23/06 23:59
  • SAheart.data: the dataset used for the homework
  • SAheart.info: the dataset used for the homework

Note 1: Submit the solution by loading it on www.dropitto.me/matteucci (pwd is dropittome)

Note 2: please name your pdf as pami_SURNAME_STUDENTID_classification.pdf; if you submit a homework for different people, please pick one of the names for the file but PUT ALL THE NAMES IN THE COVER PAGE!!

Errata Corrige: there were a few bugs in the homework text. I have updated the pdf and they were:

In the computation of feature projection, the code for the maximization of a'B*a via SVD should be changed as it follows

% maximization of a'*B*a / a'*w*a via SVD
[Vw, Dw, Vw] = svd(W);
Whalf = Vw * sqrt(Dw) * Vw'; % Whalf'*Whalf == W
Wminushalf = inv(Whalf);
Mstar = M*Wminushalf;
   % Add this variable for computing Mstar mean
   meanMstar = mean(Mstar);
for i=1:size(M,1)
   % Remove the mean saved before the loop
   Mstar(i,:) = Mstar(i,:)-meanMstar;
end
Bstar = Mstar'*Mstar;
[Vstar, Db, Vstar] = svd(Bstar);

In the Fisher projection it is more correct to use only the training data to learn the projection and then we can train and test on the corresponding subsets

a = FisherProjection(X(training,:),Y(training,:));
reducedX = X*a(:,1);
[mu_0, mu_1, sigma, p_0, p_1] = linearDiscriminantAnalysis_train(reducedX(training), Y(training))

I forgot to filter for just the training samples when performing Quadratic Discriminant Analysis

quadX = expandToQuadraticSpace(X);
%check this out!
size(quadX)
beta = linearRegression_train(quadX(training), Y(training));

And in general you should always train on the training data and test on the testing data ;-).

Part 3: Clustering

The code and the text of the third part of the homework are available online at these posts

• Homework 2013 on k-medoids
• Homework 2013 on hierarchical clustering

As usual, this part of the homework will contribute to the 10% of the grade; the deadline to submit the solution is before the you take the exam sending it to davide.eynard_at_gmail.com.