Publications
Preprint · arXiv · January 24, 2024
Algebraic methods for solving recognition problems with non-crossing classes
Anvar Kabulov, Alimdzhan Babadzhanov, Islambek Saymanov
Abstract
In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced on recognizing operators, and based on the application of these operators, a family of recognizing algorithms is created. An upper estimate is constructed for the model, which guarantees the completeness of the extension.
Rough Sets and Fuzzy LogicAdvanced Algebra and Logicsemigroups and automata theorypattern recognitiondecision rulesalgebraic operations
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
