Course Code: CS567
Course Name: Pattern Recognition
Prerequisites: CS201, MA203
Syllabus: Introduction to Pattern Recognition: Learning paradigms, Supervised and unsupervised learning; Bayesian decision theory: Minimum error rate classifier; Parameter estimation: Maximum likelihood and Bayesian Estimation; Hidden Markov models; Nonparametric techniques: Nearest neighbor rules, Parzen windows; Decision trees: Axis-parallel, Oblique, Impurity measures; Feature selection: Forward, backward search; Component analysis and discriminant functions: Principal component analysis, Fisher linear discriminant, Perceptron, Support vector machines; Generalization ability of learning methods: Bias and variance, Regularization; Bootstrapping, Boosting, Bagging; Unsupervised learning and clustering: k-Means methods.
Texts: 1. R. O. Duda, P. E. Hart and D. G. Stork, Pattern classification, John Wiley & Sons, 2002.
References: 1. C. M. Bishop, Neural Networks for Pattern Recognition, Oxford University Press, 1995.
2. V. N. Vapnik, The Nature of Statistical Learning Theory, Springer, 2000.
3. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines, Cambridge University Press, 2000.
4. Selected Research Papers.