This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Yu. I. Zhuravlev, “Extremal algorithms in mathematical models for recognition and classification problems,” Dokl. Akad. Nauk SSSR, Matematika,231, No. 2 (1976).
Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms. I,” Kibernetika, No. 3 (1977).
Bak Hyng Khang, “Completeness of model of statistical recognition algorithms,” Zh. Vychisl. Mat. Mat. Fiz.,18, No. 1 (1978).
Bak Hyng Khang, “Models of recognition algorithms of potential function type,” Zh. Vychisl. Mat. Mat. Fiz.,18, No. 2 (1978).
Yu. I. Zhuravlev and V. V. Nikiforov, “Recognition algorithms based on calculation of estimates,” Kibernetika, No. 3 (1971).
Bak Hyng Khang, “On a parametric family of statistical recognition algorithms,” Zh. Vychisl. Mat. Mat. Fiz.,17, No. 5 (1977).
Translated from Kibernetika, No. 4, pp. 131–137, July–August, 1978.
About this article
Cite this article
Khang, B.R. Sufficient conditions of completeness of linear closures of recognition algorithms. Cybern Syst Anal 14, 620–628 (1978). https://doi.org/10.1007/BF01069848
- Operating System
- Artificial Intelligence
- System Theory
- Recognition Algorithm