1 / 13

130 likes | 145 Views

ECE471-571 – Pattern Recognition Lecture 4 – Parametric Estimation. Hairong Qi, Gonzalez Family Professor Electrical Engineering and Computer Science University of Tennessee, Knoxville http://www.eecs.utk.edu/faculty/qi Email: hqi@utk.edu. Pattern Classification. Statistical Approach.

Download Presentation
## ECE471-571 – Pattern Recognition Lecture 4 – Parametric Estimation

**An Image/Link below is provided (as is) to download presentation**
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.
Content is provided to you AS IS for your information and personal use only.
Download presentation by click this link.
While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

**ECE471-571 – Pattern RecognitionLecture 4 – Parametric**Estimation Hairong Qi, Gonzalez Family Professor Electrical Engineering and Computer Science University of Tennessee, Knoxville http://www.eecs.utk.edu/faculty/qi Email: hqi@utk.edu**Pattern Classification**Statistical Approach Non-Statistical Approach Supervised Unsupervised Decision-tree Basic concepts: Baysian decision rule (MPP, LR, Discri.) Basic concepts: Distance Agglomerative method Syntactic approach Parameter estimate (ML, BL) k-means Non-Parametric learning (kNN) Winner-takes-all LDF (Perceptron) Kohonen maps NN (BP) Mean-shift Support Vector Machine Deep Learning (DL) Dimensionality Reduction FLD, PCA Performance Evaluation ROC curve (TP, TN, FN, FP) cross validation Stochastic Methods local opt (GD) global opt (SA, GA) Classifier Fusion majority voting NB, BKS**Bayes Decision Rule**Maximum Posterior Probability If , then x belongs to class 1, otherwise, 2. Likelihood Ratio Discriminant Function Case 1: Minimum Euclidean Distance (Linear Machine), Si=s2I Case 2: Minimum Mahalanobis Distance (Linear Machine), Si = S Case 3: Quadratic classifier , Si = arbitrary**Calculate m, S**Estimating Normal Densities***Why? – Maximum Likelihood Estimation**Compare “likelihood”****Why? – Baysian Estimation**• Maximum likelihood estimation • The parameters are fixed • Find value for q that best agrees with or supports the actually observed training samples – likelihood of q w.r.t. the set of samples • Baysian estimation • Treat parameters as random variable themselves**** mn and sn**Our best guess for m after observing n samples Measures our uncertainty about this guess • Behavior of Bayesian learning • The larger the n, the smaller the sn – each additional observation decreases our uncertainty about the true value of m • As n approaches infinity, p(m|D) becomes more and more sharply peaked, approaching a Dirac delta function. • mn is a linear combination between the sample mean and m0

More Related