Conditions of the correctness for the algebra of estimates calculation algorithms with μ-operators over a set of binary-data recognition problems

2017

Closed access Metadata (CSL-JSON)
DOI 10.1134/s1054661817020043
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

This paper is aimed to show that specialized neural networks can be useful for finding exact solutions of the recognition problems involving binary data. For this purpose, as an original subclass, we take the subclass of estimates calculation algorithms (ECAs) in which all algorithms correspond to three-level multilayer neural networks (μ-blocks). The correctness conditions are defined that allow a correct algorithm to be constructed in the algebra over this ECA subclass for each Ω-regular recognition problem. This approach does not require additional constraints, except for a trivial one, on the system of ECA support sets.