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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

By using the algebraic approach to pattern recognition problems and the theory of local and universal constraints, universal constraints are described as sets of mappings that preserve m-place predicates. It is shown that symmetric and functional constraints admit a similar description.

Original languageEnglish
Pages (from-to)527-532
Number of pages6
JournalComputational Mathematics and Mathematical Physics
Volume47
Issue number3
DOIs
Publication statusPublished - Mar 1 2007

Keywords

  • Algebraic approach
  • Pattern recognition
  • Precedent training
  • Theory of local and universal constraints

ASJC Scopus subject areas

  • Computational Mathematics

Fingerprint Dive into the research topics of 'Predicate description of universal constraints in the algebraic approach to pattern recognition problems'. Together they form a unique fingerprint.

  • Cite this