模式识别课件prch2part3_ding.ppt

Pattern Classification Chapter 2(Part 3) 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 2 (part 3)Bayesian Decision Theory (Sections 2-6,2-9) Discriminant Functions for the Normal Density Bayes Decision Theory – Discrete Features 2.6 Discriminant Functions for the Normal Density We saw that the minimum error-rate classification can be achieved by the discriminant function gi(x) = ln p(x | ?i) + ln P(?i) Case of multivariate normal Case ?i = ?2.I (I stands for the identity matrix) A classifier that uses linear discriminant functions is called “a linear machine” The decision surfaces for a linear machine are pieces of hyperplanes defined by: gi(x) = gj(x) The hyperplane separating Ri and Rjalways orthogonal to the line linking the means! Case ?i = ? (covariance of all classes are identical but arbitrary!) Hyperplane separating Ri and Rj (the hyperplane separating Ri and Rj is generally not orthogonal to the line between the means!) Case ?i = arbitrary The covariance matrices are different for each category (Hyperquadrics which are: hyperplanes, pairs of hyperplanes, hyperspheres, hyperellipsoids, hyperparaboloids, hyperhyperboloids) Example R1(3,8),(3,4),(2,6),(4,6); R2(3,0),(3,-4),(1,-2),(5,-2) 2.9 Bayes Decision Theory – Discrete Features Components of x are binary or integer valued, x can take only one of m discrete values v1, v2, …, vm Case of independent binary features in 2 category problem Let x = [x1, x2, …, xd ]t where each xi is either 0 or 1, with probabilities: pi = P(xi = 1 | ?1) qi = P(xi = 1 | ?2) The discriminant function in this case is: Assignment :2.6.25, 2.9.43 * *