Predicate description of universal constraints in the algebraic approach to pattern recognition problems

DOI10.1134/S0965542507030153MaRDI QIDQ5311044zbMATH OpenFDO

Authors R. S. Takhanov

Publication date 15 October 2007

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0965542507030153

zbMATH Keywords

algebraic approachpattern recognitionprecedent trainingtheory of local and universal constraints

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• Symmetric constraints in classification problems that permit replacement by functional constraints
• Semantic description and recognition of patterns
• Constraints and universal algebra
• Application of universal constraints in the analysis of classification algorithms
• Properties of multialgebraic systems in problems of comparative recognition

Cited in

(4)

• Symmetric constraints in classification problems that permit replacement by functional constraints
• Semantic description and recognition of patterns
• Maximum predicate descriptions of sets of mappings
• Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas

This page was built for publication: Predicate description of universal constraints in the algebraic approach to pattern recognition problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311044)