WJ-CH05-模式识别-模式选择 英文版 演示教学.ppt

Sequential backward selection. Here the reverse procedure is followed. Compute C for each feature. Select the “best” one, say x1 For all possible 2D combinations of x1, i.e., [x1, x2], [x1, x3], [x1, x4] compute C and choose the best, say [x1, x3]. For all possible 3D combinations of [x1, x3], e.g., [x1, x3, x2], etc., compute C and choose the best one. The above procedure is repeated till the “best” vector with features has been formed. This is also a suboptimal technique, requiring: operations. Floating Search Methods The above two procedures suffer from the nesting effect. Once a bad choice has been done, there is no way to reconsider it in the following steps. In the floating search methods one is given the opportunity in reconsidering a previously discarded feature or to discard a feature that was previously chosen. The method is still suboptimal, however it leads to improved performance, at the expense of complexity. Remarks: Besides suboptimal techniques, some optimal searching techniques can also be used, provided(假如) that the optimizing cost has certain properties, e.g., monotonic(单调). Instead of using a class separability measure (filter techniques过滤技术) or using directly the classifier (wrapper techniques包裹技术), one can modify the cost function of the classifier appropriately, so that to perform feature selection and classifier design in a single step (embedded嵌入技术) method. For the choice of the separability measure a multiplicity(多样性) of costs have been proposed, including information theoretic costs. 王杰(博士/教授/博导) 郑州大学电气工程学院 0371 wj@zzu.edu.cn 模式识别 Pattern Recognition Chapter 5 FEATURE SELECTION The goals: Select the “optimum” number l of features Select the “best” l features Large l has a three-fold disadvantage: High computational demands Low generalization performance Poor error estimates FEATURE SELECTION Given N l must be large enough to learn what makes classes different what makes patterns in