### Abstract

A problem is solved on description of a set of functional universal constraints for classification algorithms corresponding to particular systems of symmetrical universal constraints. The problem considered is a part of the algebraic approach to the problem of synthesis of correct recognition algorithms. The problem of description is studied for a set of functional signatures, corresponding to one and the same unknown group. Only permissible functional signatures, satisfying the specified condition, are considered. The theorem of equivalence of signatures without stationary pairs. The given theorem provides the description of a set of equivalent functional signatures.

Original language | English (US) |
---|---|

Pages (from-to) | 108-112 |

Number of pages | 5 |

Journal | Kibernetika i Vychislitel'naya Tekhnika |

Issue number | 2 |

State | Published - Mar 1 1991 |

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

**Connection of constraints of homogeneity and independence for classification algorithms.** / Zorin, Denis.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Connection of constraints of homogeneity and independence for classification algorithms

AU - Zorin, Denis

PY - 1991/3/1

Y1 - 1991/3/1

N2 - A problem is solved on description of a set of functional universal constraints for classification algorithms corresponding to particular systems of symmetrical universal constraints. The problem considered is a part of the algebraic approach to the problem of synthesis of correct recognition algorithms. The problem of description is studied for a set of functional signatures, corresponding to one and the same unknown group. Only permissible functional signatures, satisfying the specified condition, are considered. The theorem of equivalence of signatures without stationary pairs. The given theorem provides the description of a set of equivalent functional signatures.

AB - A problem is solved on description of a set of functional universal constraints for classification algorithms corresponding to particular systems of symmetrical universal constraints. The problem considered is a part of the algebraic approach to the problem of synthesis of correct recognition algorithms. The problem of description is studied for a set of functional signatures, corresponding to one and the same unknown group. Only permissible functional signatures, satisfying the specified condition, are considered. The theorem of equivalence of signatures without stationary pairs. The given theorem provides the description of a set of equivalent functional signatures.

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

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

M3 - Article

SP - 108

EP - 112

JO - Kibernetika i Vychislitel'naya Tekhnika

JF - Kibernetika i Vychislitel'naya Tekhnika

SN - 0739-8417

IS - 2

ER -