EECE 667 – Pattern Recognition

Catalog description:
The course provides an overview of the theory, principles and algorithms used in machine learning to construct
high performance information processing systems that learn from experience. The course discusses main and
modern concepts for model selection and parameter estimation in recognition, decision making and statistical
learning problems. Special emphasis will be given to regression, classification, regularization, feature selection
and density estimation in supervised mode of learning. Students will be assigned typical machine learning
problems to investigate as projects.

Credit hours: 3 credits

Required or elective: Elective for ECE and CCE students

Prerequisites: By course: None, By topic: Fundamental and linear algebra, Ordinary differential equations,
Probability theory, Statistical theory and methods. Introduction to Algorithms - desirable, but not required

Textbook(s) and/or required materials:

− Pattern Recognition and Machine Learning by C. Bishop, Springer 2006.
− Lecture materials will be posted on Moodle.

References:
− Pattern Classification by R. O. Duda, P.E.D. Hart and G. Stork, New York, NY: Wiley, 2002.
− Classification, Parameter Estimation and State Estimation - An Engineering Approach Using Matlab, by F.
van der Heijden, R.P.W. Duin, D. de Ridder and D.M.J. Tax, 2004.

Computer usage: Matlab, C.

Course Objectives
Correlates to
The objectives of this course are to: program
objectives
Provide knowledge of models, methods and tools used to solve regression, 1,2 and 4
classification, feature selection and density estimation problems
Provide knowledge of learning and adaptation in supervised modes of learning 1,2
Provide knowledge of recognition, decision making and statistical learning problems. 1,2
Provide knowledge of current research topics and issues in Pattern Recognition and 1
Machine Learning
Provide experience in conducting and presenting a literature review on a research 1 and 3
topic
Provide hands-on experience in analyzing and developing solutions/algorithms 1, 2 and 3
capable of learning

Course Topics
No. Subjects covered 75 min lectures
1 Machine Learning Fundamentals, Bayesian, Decision and Information 3
Theories
2 Discriminative Methods : Nearest Neighbor, Hyperplane geometry, Minimum 5
Squared Error procedures
3 Generative Methods : Maximum Likelihood Estimation, Fisher Linear 6
Discriminant, Principal Component Analysis, Density Estimation
4 Kernel Methods: SVM classification and regression 4
5 Sequential Data: Hidden Markov Models 3
6 Validation methods and Sampling techniques 3
7 Evolutionary Methods 2
Course Learning Outcomes
Correlates to program outcomes*
At the end of the course, students:
H M L
Identify areas where Pattern Recognition and Machine Learning a,b,d,e,h,j
can offer a solution
Describe the strength and limitations of some techniques used in a,b,e
computational Machine Learning for classification, regression and
density estimation problems
Describe genetic algorithms, validation methods and sampling a, b,d,j
l
techniques
Describe some discriminative, generative and kernel based a, b,d,h
l
techniques
Describe and model sequential data a,b l
Solve problems in regression and classification a,b,e,h l
Implement learning algorithms for supervised tasks a,b l c
Conduct, document and present a literature review on a topic d, e, g, i, j
related to Machine Learning and Pattern Recognition
* H: High correlation, M: Medium correlation, L: Low correlation

Class/laboratory schedule: Two 75-minute lectures per week.

Evaluation methods
1. Projects and presentation 40%
2. Assignments 5%
3. Midterm 20%
4. Final Exam 35%

Professional component
Engineering topics: 100%
General education: 0%
Mathematics and basic sciences: 0%

Person(s) who prepared this description and date of preparation

Mariette Awad, April 2008

Date of last revision

January 2009