Announcements

  1. (Jan 30) Course page is online.
  2. (Feb 3) Slides for Introduction to Pattern Recognition are available.
  3. (Feb 10) Slides for Bayesian Decision Theory are available.
  4. (Feb 16) First part of the slides for Parametric Models is available.
  5. (Feb 23) Second part of the slides for Parametric Models is available.
  6. (Mar 2) Third part of the slides for Parametric Models is available.
  7. (Mar 3) Homework assignment 1 is available.
  8. (Mar 9) Fourth part of the slides for Parametric Models is available.
  9. (Mar 15) Slides for Non-parametric Methods are available.
  10. (Mar 23) Slides for Feature Reduction and Selection are available.
  11. (Mar 31) Homework assignment 2 is available.
  12. (Apr 13) First part of the slides for Non-Bayesian Classifiers is available.
  13. (Apr 13) Second part of the slides for Non-Bayesian Classifiers is available.
  14. (Apr 13) Third part of the slides for Non-Bayesian Classifiers is available.
  15. (Apr 28) Slides for Unsupervised Learning and Clustering are available.
  16. (Apr 30) Homework assignment 3 is available.
  17. (May 4) Slides for Algorithm-Independent Learning Issues are available.
  18. (May 11) Slides for Structural and Syntactic Pattern Recognition are available.

Personnel

Instructor: Selim Aksoy
Office: EA 423
Email:

Course Information

Schedule: Wed 13:40-17:30 (EB 201)
Office hours: Wed 10:40-12:30 (EA 423)
Prerequisites: Probability theory, statistics, linear algebra

Texts

Lecture Schedule

Chapters

Contents

Introduction to Pattern Recognition

[ Slides ]

(Feb 3)

Topics:
  • Pattern recognition systems
  • The design cycle
  • An example
Readings:
  • DHS Ch 1, Appendix A.1-A.2, A.4-A.5
References:

Bayesian Decision Theory

[ Slides ]

(Feb 10)

Topics:
  • Modeling using continuous and discrete features
  • Discriminant functions
  • The Gaussian density
  • Error estimation
Readings:
  • DHS Ch 2.1-2.9
References:

Parametric Models

[ Slides: Part 1 | Part 2 | Part 3 | Part 4 ]

(Feb 17, 24, Mar 3, 10)

Topics:
  • Maximum-likelihood estimation
  • Bayesian estimation
  • Expectation-Maximization and mixture density estimation
  • Hidden Markov Models
  • Bayesian Belief Networks
Readings:
  • DHS Ch 3.1-3.5, 3.9, 10.2-10.4, 3.10, 2.11
References:

Non-parametric Methods

[ Slides ]

(Mar 17)

Topics:
  • Density estimation
  • Histogram-based estimation
  • Parzen windows estimation
  • Nearest neighbor estimation
Readings:
  • DHS Ch 4.1-4.4

Feature Reduction and Selection

[ Slides ]

(Mar 24)

Topics:
  • Problems of dimensionality
  • Component analysis
    • Principal components analysis (PCA)
    • Linear discriminant analysis (LDA)
  • Feature selection
Readings:
  • DHS Ch 3.7-3.8, 10.13-10.14
References:

Non-Bayesian Classifiers

[ Slides: Part 1 | Part 2 | Part 3 ]

(Apr 14, 21)

Topics:
  • k-nearest neighbor classifier
  • Linear discriminant functions
  • Support vector machines
  • Neural networks
  • Decision trees
Readings:
  • DHS Ch 4.5-4.6, 5.1-5.3, 5.11, 6.1-6.3, 8.1-8.3
References:

Unsupervised Learning and Clustering

[ Slides ]

(Apr 28)

Topics:
  • Criterion functions for clustering
  • k-means clustering
  • Hierarchical clustering
  • Graph-theoretic clustering
  • Cluster validity
Readings:
  • DHS Ch 10.1, 10.6-10.7, 10.9-10.10, 10.12
References:

Algorithm-Independent Learning Issues

[ Slides ]

(May 5)

Topics:
  • No Free Lunch Theorem
  • Resampling for classifier design
  • Comparing classifiers
  • Combining classifiers
Readings:
  • DHS Ch 9.1-9.2, 9.5-9.7
References:

Structural and Syntactic Pattern Recognition

[ Slides ]

(May 12)

Topics:
  • Recognition with strings
  • Grammatical methods
  • Graph-theoretic methods
Readings:
  • DHS Ch 8.5-8.6
References:

Exams

Assignments

  1. Homework assignment 1 (Due: March 24, 2010 as hardcopy in the class)
  2. Homework assignment 2 (Due: April 21, 2010 as online submission)
  3. Homework assignment 3 (Due: May 23, 2010 as online submission)

Late submission policy: Unless you make prior arrangements with me (before the due date), no late homework will be accepted.

Grading Policy

Homework:50%
Midterm exam:20%
Final exam:25%
Class participation:5%

Related Links