Abstract:
It is shown that, in the pattern recognition problem with two nonoverlapping classes, the matrices of estimates of the object closeness are described by a metric. The transition to the algebraic closure of the model of recognizing operators of finite degree corresponds to the application of a special transformation of this metric. It is proved that the minimal degree correct algorithm can be found as a polynomial of a special form. A simple criterion for testing classification implementations is obtained.
Key words:pattern recognition, estimation algorithm, matrices of estimates, correct algorithm, algebra over algorithms, metric, Gram's matrix, minimal degree.
Fulltext:
PDF file (1230 kB)