模式识别课件prch2part2_ding.ppt

Pattern Classification Chapter 2 (Part 2) Chapter 2 (Part 2): Bayesian Decision Theory(Sections 2.3-2.5) Minimum-Error-Rate Classification Classifiers, Discriminant Functions and Decision Surfaces The Normal Density 2.3 Minimum-Error-Rate Classification Actions are decisions on classes If action ?i is taken and the true state of nature is ?j then: the decision is correct if i = j and in error if i ? j Seek a decision rule that minimizes the probability of error which is the error rate Introduction of the zero-one loss function: Therefore, the conditional risk is:   “The risk corresponding to this loss function is the average probability error” ? Minimize the risk requires maximize P(?i | x) (since R(?i | x) = 1 – P(?i | x)) For Minimum error rate Decide ?i if P (?i | x) P(?j | x) ?j ? i Regions of decision and zero-one loss function, therefore: If ? is the zero-one loss function which means: 2.4 Classifiers, Discriminant Functionsand Decision Surfaces The multi-category case Set of discriminant functions gi(x), i = 1,…, c The classifier assigns a feature vector x to class ?i if: gi(x) gj(x) ?j ? i For the minimum risk case Let gi(x) = - R(?i | x) (max. discriminant corresponds to min. risk!) For the minimum error rate cae, we take gi(x) = P(?i | x) (max. discrimination corresponds to max. posterior!) gi(x) ? p(x | ?i) P(?i) gi(x) = ln p(x | ?i) + ln P(?i) (ln: natural logarithm!) Feature space divided into c decision regions if gi(x) gj(x) ?j ? i then x is in Ri (Ri means assign x to ?i) The two-category case A classifier is a “dichotomizer” that has two discriminant functions g1 and g2 Let g(x) ? g1(x) – g2(x) Decide ?1 if g(x) 0 ; Otherwise decide ?2 The computation of g(x) 2.5 The Normal Density Univariate density Continuous density A lot of processes are asymptotically Gaussian Handwritten characters, speech sounds are ideal or prototype corrupted by random process (central limit theorem) Where: