The construction of a recognition algorithm in the algebraic closure. (Q1395164)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The construction of a recognition algorithm in the algebraic closure. |
scientific article; zbMATH DE number 1940572
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The construction of a recognition algorithm in the algebraic closure. |
scientific article; zbMATH DE number 1940572 |
Statements
The construction of a recognition algorithm in the algebraic closure. (English)
0 references
29 June 2003
0 references
In this paper the recognition problem Z with the conventional learning information is considered. The existence of a subclass of algorithms for calculating estimates of the algorithm that is error-free not only on the test sample but also on the learning sample is proved for the set of recognition problems {Z}.
0 references
recognition algorithm
0 references
estimates
0 references
existence
0 references
error-free
0 references
learning sample
0 references
regular problem
0 references
0.87988156
0 references
0.84642047
0 references
0.8400524
0 references
0.8377123
0 references
0 references
0.83554405
0 references
