Article · Mathematics · August 26, 2026
Methods for Synthesizing Optimal K-Value Correcting Functions
Anvar Kabulov, Islambek Saymanov, Alimdzhan Babadzhanov, O’rinov Nodirbek Toxirjonovich, Mansur Berdimurodov, Azimjon Arabboev
Abstract
This paper explores the problem of developing correcting functions that replace multiple unreliable (heuristic) recognition algorithms with a single, consistent decision function. The research concept stems from the fact that, in pattern recognition and collective expert decision-making problems, individual algorithms (heuristics) provide inconsistent or incomplete answers, requiring a mathematically sound method for their harmonization (correction) using test data. The methodological content of this paper consists of introducing classes of k-valued logic correcting functions that satisfy the constraints of preserving given sets (Constraint I) and monotonicity (Constraint II), and constructing algorithms for synthesizing a corrector that is optimal with respect to the linear performance functional for each combination of these constraints. The paper also provides a rationale for the optimality of the constructed algorithms (an optimality theorem) and an estimate of their time complexity.
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
