Skip to main content
Log in

Efficiency of the Bayesian Recognition Procedure

  • Published:
Cybernetics and Systems Analysis Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. A. M. Gupal,S. V. Pashko, andI. V. Sergienko, “Efficiency of the Bayesian classification procedure,” Kibern. Sist. Anal., No. 4, 78–89 (1995).

  2. A. S. Nemirovskii andD. B. Yudin, Problem Complexity and Efficiency of Optimization Methods [in Russian], Nauka, Moscow (1979).

    Google Scholar 

  3. F. Hausdorff, Theory of Sets [Russian translation], Gl. Red. Tekh.-Teor. Lit., Moscow-Leningrad (1937).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016663916262

Navigation