Abstract
We describe a set of functional universal constraints for classification algorithms that correspond to particular systems of symmetric universal constraints.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
K. V. Rudakov, “Universal and local constraints in the problem of correction of heuristic algorithms,” Kibernetika, No. 2, 30–35 (1987).
K. V. Rudakov, “Completeness and universal constraints in the problem of correction of heurstic classification algorithms,” Kibernetika, No. 3, 106–109 (1987).
K. V. Rudakov, “Symmetric and functional constraints in the problem of correction of heurstic classification algorithms,” Kibernetika, No. 4, 73–77 (1987).
Yu. I. Zhuravlev, “Correct algebras on sets of incorrect heuristic algorithms. I, II” Kibernetika, No. 4, 21–27 (1977).
Yu. I. Zhuravlev, “An algebraic approach to problems of recognition and classification,” Probl. Kiber., No. 33, 5–68 (1978).
K. V. Rudakov, On Some Classes of Classification Algorithms (General Results) [in Russian], VTs Akad. Nauk SSSR, Moscow (1980).
Additional information
Translated from Kibernetika, No. 2, pp. 108–112, March–April, 1991.
Rights and permissions
About this article
Cite this article
Zorin, D.N. Relationship between homogeneity and independence constraints for classification algorithms. Cybern Syst Anal 27, 304–309 (1991). https://doi.org/10.1007/BF01068384
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068384