On Correctness Conditions for Algebra of Recognition Algorithms with μ-Operators over Pattern Problems with Binary Data

2018

Closed access Metadata (CSL-JSON)
DOI 10.1134/s1064562418060078
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

The concept of an Ω-weakly regular problem is introduced. On the basis of the Zhuravlev operator approach combined with the neural network paradigm, it is shown that, for each such problem, a correct algorithm and a six-level spatial neural network reproducing the computations executed by this algorithm can be constructed. Moreover, the set of Ω-weakly regular problems includes the set of Ω-regular problems. It turns out that a three-level spatial network (μ-block) is a forward propagation network whose inner loop under estimation of the class membership for each test object consists of a single iteration. As a result, the amount of computations required for the six-level network is reduced noticeably.