This is a preview of subscription content, log in via an institution to check access.
References
K. V. Rudakov, “Universal and local constraints in the problem of correction of heuristic algorithms,“Kibernetika, No. 2, 33–35 (1987).
K. V. Rudakov, “Completeness and universal constraints in the problem of correction of heuristic classification algorithms,“Kibernetika, No. 3, 106–109 (1987).
K. V. Rudakov, “Symmetric and functional constraints in the problem of correction of heuristic classification algorithms,“Kibernetika, No. 4, 73–77 (1987).
K. V. Rudakov,On Some Classes of Recognition Algorithms (General Results) [in Russian], Computer Center, Acad. Sci. USSR, Moscow (1980).
Yu. I. Zhuravlev, “Correct algebras over sets of incorrect (heuristic) algorithms. I, II,“Kibernetika, No. 4, 21–27 (1977).
Yu. V. Zhuravlev, “On an algebraic approach to the solution of recognition and classification problems,“Probl. Kibern., No. 33, 5–68 (1978).
D. N. Zorin, “On the relationship of homogeneity and independence constraints in classification problems,“Kibernetika, No. 2, 108–112 (1991).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 72–80, July–August, 1993.
Rights and permissions
About this article
Cite this article
Zorin, D.N. Symmetric constraints in classification problems that permit replacement by functional constraints. Cybern Syst Anal 29, 531–537 (1993). https://doi.org/10.1007/BF01125867
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01125867