A learning scheme for a fuzzy k-NN rule
暂无分享,去创建一个
The performance of a fuzzy k-NN rule depends on the number k and a fuzzy membership-array W[I, mR], where l and m R denote the number of classes and the number of elements in the reference set X R respectively. The proposed learning procedure consists in iterative finding such k and W which minimize the error rate estimated by the 'leaving one out' method.
[1] Robert P. W. Duin. The use of continuous variables for labeling objects , 1982, Pattern Recognit. Lett..
[2] Jack Koplowitz,et al. On the relation of performance to editing in nearest neighbor rules , 1981, Pattern Recognit..
[3] M. R. Mickey,et al. Estimation of Error Rates in Discriminant Analysis , 1968 .