|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2005, Volume 45, Number 2, Pages 354–356
(Mi zvmmf712)
|
|
|
|
Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms
E. A. Lutsenko Moscow State Pedagogical University
Abstract:
The problem of the recovery of a partially defined predicate on a metric compact of special form is considered. In a certain family of algorithms (for example, algorithms for computing estimates), an algorithm of the predicate evaluation is constructed, and its stability on the set of the recovery problems in a neighborhood of the given problem is proved. The lower bound for the stability radius of the algorithm constructed is computed.
Key words:
correct binary classification algorithm, polynomial closure of algorithms.
Received: 03.02.2004 Revised: 14.08.2004
Citation:
E. A. Lutsenko, “Stability of a correct algorithm in the polynomial closure of the family of binary classification algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 45:2 (2005), 354–356; Comput. Math. Math. Phys., 45:2 (2005), 338–340
Linking options:
https://www.mathnet.ru/eng/zvmmf712 https://www.mathnet.ru/eng/zvmmf/v45/i2/p354
|
Statistics & downloads: |
Abstract page: | 176 | Full-text PDF : | 66 | References: | 45 | First page: | 1 |
|