The construction of a recognition algorithm in the algebraic closure.

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}.

Recommendations

scientific article; zbMATH DE number 5592446
On the correctness of algebraic closures of recognition algorithms of the “tests” type
The algebraic closure of a family of separated algorithms
Recognition of algebraic dependence in finitely generated algebras.
Recognition of certain properties of automaton algebras.
On the completeness of the algebraic closure of the space of recognition operators with test support sets
scientific article; zbMATH DE number 215188
Synthesis of a correct recognition algorithm as a minimal covering construction problem
Algorithmic recognition of identities in one class of finitely presented semigroups
scientific article; zbMATH DE number 1187223

Cited in

(23)

Design of trend-identification algorithms with learning (algebraic approach)
The task-oriented optimization of bases in recognition problems
Correct sigma-pi extensions of one admissible class of algorithms
An algebraic approach in describing the method of target iterative classification
Correct algebras over estimation algorithms in the set of regular recognition problems with nonoverlapping classes
Pattern recognition algorithms' models based on potential principles
scientific article; zbMATH DE number 3858220 (Why is no real title available?)
On the correctness of algebraic closures of recognition algorithms of the “tests” type
The algebraic closure of a family of separated algorithms
The solution of recognition problems with information given by the enumeration of domains
A correct model of regonition algorithms of bounded capacity, based on the concept of potential
Metrics of algebraic closures in pattern recognition problems with two nonoverlapping classes
On the completeness of the algebraic closure of the space of recognition operators with test support sets
On the ill-posed nature of the algebraic closure of the second power of a set of algorithms for calculating estimates
An approach to the question of constructing effective recognition algorithms
scientific article; zbMATH DE number 2048727 (Why is no real title available?)
scientific article; zbMATH DE number 6415740 (Why is no real title available?)
An algebra over estimation algorithms: the minimal power of the correct algorithm
scientific article; zbMATH DE number 2206818 (Why is no real title available?)
scientific article; zbMATH DE number 2214272 (Why is no real title available?)
Algebraic closures of a generalized model of estimation algorithms
On the correctness of linear closure in a class of estimation algorithms
On constructive and well-behaved classes of algebraic \(\Sigma \Pi \)-algorithms

This page was built for publication: The construction of a recognition algorithm in the algebraic closure.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395164)