Skip to main content
SpringerLink
Log in

Completeness and universal constraints in the correction problem for heuristic classification algorithms

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms. I, II,” Kibernetika, No. 4, 5–17, No. 6, 21–27 (1977).

    Google Scholar 

  2. Yu. I. Zhuravlev, “On an algebraic approach to solving recognition or classification problems,” Probl. Kibern., No. 33, 5–68 (1978).

    Google Scholar 

  3. K. V. Rudakov, On Certain Classes of Recognition Algorithms (General Results) [in Russian], Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1980).

    Google Scholar 

  4. K. V. Rudakov, On Certain Classes of Recognition Algorithms (Parametric Models) [in Russian], Vychisl. Tsentr Akad. Nauk SSSR, Moscow (1981).

    Google Scholar 

  5. K. V. Rudakov, “Universal and local, constraints in the correction problem for heuristic algorithms,” Kibernetika, No. 2, 30–35 (1987).

    Google Scholar 

Download references

Authors
  1. K. V. Rudakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 106–108, 119, May–June, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rudakov, K.V. Completeness and universal constraints in the correction problem for heuristic classification algorithms. Cybern Syst Anal 23, 414–418 (1987). https://doi.org/10.1007/BF01074835

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01074835

Keywords

Search

Navigation