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 2007
Externally publishedYes

Fingerprint

Algebraic Approach
Predicate
Pattern Recognition
Pattern recognition

Keywords

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

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

@article{79b71b7590bd496294e93b2e90f13218,
title = "Predicate description of universal constraints in the algebraic approach to pattern recognition problems",
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.",
keywords = "Algebraic approach, Pattern recognition, Precedent training, Theory of local and universal constraints",
author = "Takhanov, {R. S.}",
year = "2007",
month = "3",
doi = "10.1134/S0965542507030153",
language = "English",
volume = "47",
pages = "527--532",
journal = "Computational Mathematics and Mathematical Physics",
issn = "0965-5425",
publisher = "Maik Nauka-Interperiodica Publishing",
number = "3",

}

TY - JOUR

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

AU - Takhanov, R. S.

PY - 2007/3

Y1 - 2007/3

N2 - 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.

AB - 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.

KW - Algebraic approach

KW - Pattern recognition

KW - Precedent training

KW - Theory of local and universal constraints

UR - http://www.scopus.com/inward/record.url?scp=34247173661&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34247173661&partnerID=8YFLogxK

U2 - 10.1134/S0965542507030153

DO - 10.1134/S0965542507030153

M3 - Article

AN - SCOPUS:34247173661

VL - 47

SP - 527

EP - 532

JO - Computational Mathematics and Mathematical Physics

JF - Computational Mathematics and Mathematical Physics

SN - 0965-5425

IS - 3

ER -