Back close

Course Detail

Course Name Pattern Recognition
Course Code 24ASD641
Program M.Sc. in Applied Statistics and Data Analytics
Credits 3
Campus Coimbatore , Kochi

Syllabus

Unit I

Introduction to Pattern Recognition, Introduction – Pattern recognition systems – the design cycle – learning and adaptation – Applications of Pattern recognition – statistical decision theory – Examples on pattern recognition, and image processing and analysis.

Unit II

Parametric methods of Classification, Introduction – Bayes theorem and Bayesian decision making – classifications based on single and multiple features – conditionally independent features – discrete and continuous features – Gaussian case and general theory – discriminant functions, decision boundaries and decision regions –– problems of dimensionality – components analysis and discriminants – Minimum error rate classification – Receiver Operating characteristic curves – Estimation of the composition of populations based on machine learning classification.

Unit III

Nonparametric methods Classification, Introduction – histograms – density estimation –mixture densities – kernel and window estimators – nearest neighbor classification techniques – rules and distance metrics – single and k-nearest neighbor techniques –adaptive decision boundaries and discriminant functions – minimum squared error discriminant functions.

Unit IV

Nonmetric methods of classification, Introduction to Nonmetric methods – decision trees and decision regions– CART methods – algorithm-independent machine learning – lack of inherent superiority of any classifier – bias and variance for regression and classification – resampling or estimating statistics – jackknife and bootstrap resampling methods.

Unit V

Methods of Clustering, Introduction to unsupervised learning and clustering – data description and clustering – criterion functions for clustering – hierarchical clustering – single linkage algorithm, complete linkage algorithm, average linkage algorithm and Ward’s algorithm – partitional clustering – Forgy’s algorithm – and k-means algorithm. 

Objectives and Outcomes

Course Outcomes:

CO01:

To get an idea about pattern recognition with suitable examples

CO02:

To gain knowledge about parametric classification methods using Bayesian decision making approach

CO03:

To apply nonparametric techniques such as nearest neighbor, adaptive discriminant functions and decision regions based on minimum squared error

CO04:

To gain knowledge about nonmetric methods, classification trees and some resampling methods

CO-PO Mapping:

 

PO1

PO2

PO3

PO4

PO5

PO5

PO6

PO7

PO8

PO9

PO10

PO11

PO12

CO1

3

3

2

2

2

1

         

2

1

CO2

3

2

2

2

2

1

         

2

1

CO3

3

2

2

2

2

1

         

2

1

CO4

3

2

1

2

2

1

         

2

1

CO5

2

2

2

2

2

1

         

1

1

CO05:

To apply study and apply various clustering methods

Text Books / References

Text Books/References Books:

  1. Richard O. Duda, Peter E. Hart and David G. Stork, Pattern Classification, Second Edition, 2003, John Wily & Sons.
  2. Earl Gose, Richard Johnsonbaugh and Steve Jost, Pattern Recognition and Image Analysis, 2002, Prentice Hall of India.

DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.

Admissions Apply Now