Article · Advances in Artificial Intelligence and Machine Learning · January 1, 2025
Numerical Methods of Synthesis of a Correct Algorithm for Solving Recognition Problems
Islambek Saymanov, Alimdzhan Babadzhanov, Akmal Varisov, O’rinov Nodirbek Toxirjonovich, Anvarxon Madjidov
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.
More by Islambek Saymanov
- Compressed-Domain Temporal Cues and Degradation-Aware Distillation for Lightweight Dynamic Facial Expression Recognition on Edge DevicesTechnologies · 2026
- Action-Unit-Constrained Graph Learning with Counterfactual Recourse for Auditable Facial Expression RecognitionComputers · 2026
- Three-Class Correspondence Reliability for Deformation-Preserving ICP: Controlled Synthetic Evaluation and a Cross-Domain Stress TestJournal of Imaging · 2026
- An EMC-Aware Multi-Objective Framework for Joint Radio-Resource and Transmit-Power Coordination in Ultra-Dense 5G/Beyond-5G NetworksJournal of Sensor and Actuator Networks · 2026
