Numerical Methods of Synthesis of a Correct Algorithm for Solving Recognition Problems

We mainly study the voting model. The article considers recognition problems with disjoint classes. These problems are, in a particular case, a discrete analogue of the problem of finding optimal solutions. Not only the problems of synthesizing the best solutions, but also other important classes of applied problems are reduced to recognition problems. In real calculations, there is no need to remember all the parameters 𝑃𝑟 𝑣 · 𝜀𝑟 𝑣 that determine the proximity function for the recognizable object and the sets 𝐾𝑗 . It is enough to limit ourselves to only a small part. The values of the parameters 𝜀𝑖𝑘𝑃𝑖𝑘 in problems with disjoint classes are determined independently for each class.