Fast Selection of Blur Coefficients in a Multidimensional Nonparametric Pattern Recognition Algorithm

Аннотация

A fast procedure is proposed for choosing the blur coefficients of kernel functions in a multidimensional nonparametric estimation of the equation of a decision surface for a two-alternative problem of pattern recognition. The decision classification rule meets the maximum likelihood criterion. The theoretical basis of the procedure under consideration is the result of a study of the asymptotic properties of multidimensional nonparametric estimates of the decision function in the problem of recognizing patterns and probability densities of the distribution of random variables in classes. The possibility of using fast procedures for choosing the blur coefficients of kernel estimates of probability densities in the synthesis of non-parametric estimates of the equation of the decision surface between classes is substantiated. The effectiveness of the proposed approach is confirmed by the results of computational experiments.