Work

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

Year: 2025
Type: article
Abstract: 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.
Language: English
Open Access status: bronze
OpenAlex ID: W4409035663
FWCI: 1.089
Cites:
Cited by: 1
Related to: 10