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


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

A. V. Lapko

Institute of Computational Modeling, Siberian Branch of the Russian Academy of Sciences; Reshetnev Siberian State University of Science and Technology

Author for correspondence.
Email: lapko@icm.krasn.ru
Russian Federation, Krasnoyarsk; Krasnoyarsk

V. A. Lapko

Institute of Computational Modeling, Siberian Branch of the Russian Academy of Sciences; Reshetnev Siberian State University of Science and Technology

Email: lapko@icm.krasn.ru
Russian Federation, Krasnoyarsk; Krasnoyarsk


Copyright (c) 2019 Springer Science+Business Media, LLC, part of Springer Nature

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies