|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1983, Volume 23, Number 2, Pages 467–476
(Mi zvmmf5613)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Synthesis of a correct recognition algorithm as a minimal covering construction problem
I. V. Isaev Moscow
Abstract:
Some methods of constructing correct recognition and classification algorithms, i.e., algorithms which make no mistakes when classifying given control data, are considered. The correct algorithm construction problem is shown to be reducible to thep problem of constructing the minimal covering of a set by a system of subsets. A practical way of constructing a correct algorithm was described.
Received: 07.07.1980
Citation:
I. V. Isaev, “Synthesis of a correct recognition algorithm as a minimal covering construction problem”, Zh. Vychisl. Mat. Mat. Fiz., 23:2 (1983), 467–476; U.S.S.R. Comput. Math. Math. Phys., 23:2 (1983), 137–142
Linking options:
https://www.mathnet.ru/eng/zvmmf5613 https://www.mathnet.ru/eng/zvmmf/v23/i2/p467
|
Statistics & downloads: |
Abstract page: | 179 | Full-text PDF : | 86 | First page: | 1 |
|