Difference between revisions of "Pattern Analysis and Machine Intelligence"

Revision as of 01:27, 9 November 2013

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

09/11/2013: New change of classroom ... all lectures will be in V.08 
            Update to the detailed schedule (swap between 06/12 and 13/12 teachers)
28/10/2013: The first homework for the 2013-2014 course edition has been published!
25/10/2013: new change in the classrooms! Monday in V.08 and Friday in V2.12
14/10/2013: small change in the detailed schedule of the lectures
11/10/2013: change of classroom due to limited space from V08 to VS9
08/10/2013: final grades for the 20/09/2013 exam 
07/10/2013: a new edition of the course starts today!

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!!

Note: Lecture timetable interpretation
* On Mondays lectures start at 13:15 SHARP
* On Fridays lectures start at 10:30 (quarto d'ora accademico)

(*) 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 repeat the homework after the end of the course, 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.
• Model Selection: slides presenting images, tables and examples about model selection (taken from The Elements of Statistical Learning book).
• 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).
• 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:

• 20/09/2013 Exam
• 10/09/2013 Exam
• 26/07/2013 Exam
• 11/07/2013 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

Online Resources

The following are links to online sources which might be useful to complement the material above

• MATH 574M University of Arizona Course on Statistical Machine Learning and Data Mining; here you can find slides covering part of the course topics (the reference book for this course is again The Elements of Statistical Learning)

2013-2014 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: Linear Classification Methods

• Homework 2013-2014 on Classification: 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 Sunday 17/11 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!!