模式识别prch5partding.pptVIP

Pattern ClassificationAll materials in these slides were taken from Pattern Classification (2nd ed) by R. O. Duda, P. E. Hart and D. G. Stork, John Wiley Sons, 2000 with the permission of the authors and the publisher Chapter 5:Linear Discriminant Functions(Sections 5.1-5-3) Introduction Linear Discriminant Functions and Decisions Surfaces Generalized Linear Discriminant Functions 5.1 Introduction In chapter 3, the underlying probability densities were known.The training sample was used to estimate the parameters of these probability densities (ML, MAP estimations) In this chapter, we only know the proper forms for the linear discriminant functions, and use samples to estimate the values of parameters for the discriminant functions : similar to non-parametric techniques They may not be optimal, but they are very simple and easy to compute they are chosen as candidates for initial and trial classifiers especially in the absence of information The problem of finding a linear discriminant function will be formulated as a problem a criterion function 5.2 Linear discriminant functions and decisions surfaces Definition: It is a function that is a linear combination of the components of x g(x) = wtx + w0 (1) where w is the weight vector and w0 the bias(threshold weight) A two-category classifier with a discriminant function of the form (1) uses the following rule: Decide ?1 if g(x) 0 and ?2 if g(x) 0 ? Decide ?1 if wtx -w0 and ?2 otherwise If g(x) = 0 ? x is assigned to either class The equation g(x) = 0 defines the decision surface that separates points assigned to the category ?1 from points assigned to the category ?2 When g(x) is linear, the decision surface is a hyperplane Algebraic measure of the distance from x to the hyperplane In conclusion, a linear discriminant function divides the feature space by a hyperplane decision surface The orientation of the surface is determined by the normal vector w and the location of the s