Abstract
The upper bound of the error of the Bayesian procedure for solving classification and recognition problems is obtained, depending on the number of attributes and the training-sample size. It is proved that the Bayesian method is suboptimal.
Similar content being viewed by others
REFERENCES
A. M. Gupal,S. V. Pashko, andI. V. Sergienko, “Efficiency of the Bayesian classification procedure,” Kibern. Sist. Anal., No. 4, 78–89 (1995).
A. S. Nemirovskii andD. B. Yudin, Problem Complexity and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).
F. Hausdorff, Theory of Sets [Russian translation], Gl. Red. Tekh.-Teor. Lit., Moscow-Leningrad (1937).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vagis, G.A., Gupal, A.M. & Sergienko, I.V. Efficiency of the Bayesian Recognition Procedure. Cybernetics and Systems Analysis 37, 53–57 (2001). https://doi.org/10.1023/A:1016663916262
Issue Date:
DOI: https://doi.org/10.1023/A:1016663916262