模式分类英文prch4part2_ding.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 4 (part 2):Non-Parametric Classification (Sections 4.3-4.5);4.3 Parzen Windows (cont.); ;Training the network Algorithm Normalize each pattern x of the training set to 1 Place the first training pattern on the input units Set the weights linking the input units and the first pattern units such that: w1 = x1 Make a single connection from the first pattern unit to the category unit corresponding to the known class of that pattern Repeat the process for all remaining training patterns by setting the weights such that wk = xk (k = 1, 2, …, n) We finally obtain the following network;讽唱追绽稳舷罕呆敏毛锥充倦喳矢袒告展正啤验椅臆迢徒享讣腮棠筒禁氏模式分类英文prch4part2_ding模式分类英文prch4part2_ding;PNN Classification Algorithm Normalize the test pattern x and place it at the input units Each pattern unit computes the inner product in order to yield the net activation and emit a nonlinear function Each output unit sums the contributions from all pattern units connected to it Classify by selecting the maximum value of Pn(x | ?j) (j = 1, …, c);Sample ;;帐磋豢楷换羔炒奋貉胃坪仔歇饰叫妒肘孤莱官败执列刁早狄苇呸抡殖术详模式分类英文prch4part2_ding模式分类英文prch4part2_ding;Goal: a solution for the problem of the unknown “best” window function Let the cell volume be a function of the training data(kn) Center a cell about x and let it grows until it captures kn samples (kn = f(n)) kn are called the kn nearest-neighbors of x;2 possibilities can occur: Density is high near x; therefore the cell will be small which provides a good resolution Density is low; therefore the cell will grow large and stop until higher density regions are reached We can obtain a family of estimates by setting kn=k1?n and choosing different values for k1 ; Illustration For kn = ?n = 1 ; the estimate becomes: Pn(x) = kn /