Construction of classifiers based on kernel density estimations using the a posteriori probabilities of competing sets
DOI:
https://doi.org/10.15407/dopovidi2015.09.025Keywords:
classification rule, density estimate, weight functionAbstract
An approach is proposed to construct classifiers based on kernel density estimates for solving pattern recognition problems. The approach is based on the use of the a posteriori probability and a distributive π-type measure for the effective division of competing sets. The family of density estimates is applied to each set in a wide range of bandwidths for each estimate of the class density. A procedure is proposed and adapted to combine the classification results on different levels of smoothing that provides a flexible use of different bandwidths for different pairs of competing classes. Statistical uncertainties are calculated on the basis of approximate estimated probabilities of a misclassification.
Downloads
References
Godtliebsen F., Marron J. S., Chaudhuri P. J. of Computational and Graphical Statistics, 2002, 11: 3–21. https://doi.org/10.1198/106186002317375596
Holmes C. C., Adams N. M. J. of the Royal Statistical Society, 2002, 64: 297–304.
Hall P. The Annals of Statistics, 1983, 11: 1160–1173.
Lachenbruch P., Mickey M. Technometrics, 1968, 10: 3–10.
Silverman B. W. Density estimation for Statistics and Data Analysis, London: Chapman and Hall, 1986. https://doi.org/10.1007/978-1-4899-3324-9
Wand M., Jones M. Kernel Smoothing, London: Chapman and Hall, 1995: 1–14. https://doi.org/10.1007/978-1-4899-4493-1_1
Ripley B. Pattern Recognition and Neural Networks, Cambridge: Cambridge University Press, 1996: 1–17. https://doi.org/10.1017/CBO9780511812651.002
Duda R., Hart P., Stork D. Pattern Classification, New York: Wiley, 2000: 1–21.
Chaudhuri P., Marron J. The Annals of Statistics, 2000, 28: 410–427. https://doi.org/10.1214/aos/1016218224
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Reports of the National Academy of Sciences of Ukraine

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.