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.
Key words:precedent training, pattern recognition, algebraic approach, theory of local and universal constraints.
Fulltext:
PDF file (737 kB)