METHODS FOR RAPID SELECTION OF KERNEL FUNCTION BLUR COEFFICIENTS IN A NONPARAMETRIC PATTERN RECOGNITION ALGORITHM

摘要

A fast algorithm is proposed for choosing the coefficients of blur coefficients for kernel functions in a nonparametric estimate of the separating surface equation for a two-alternative pattern recognition problem. The algorithm is based on the results of a study of the asymptotic properties of nonparametric estimates of the decision function in the recognition problem for patterns and the probability densities of the distribution of random variables in classes. We compare the proposed algorithm with the traditional approach based on minimizing the estimated probability of a classification error.