GENERAL SCHEME FOR CONSTRUCTING THE MOST COMPLEX LOGICAL TREE OF CLASSIFICATION IN PATTERN RECOGNITION DISCRETE OBJECTS

Abstract

The work raises an important question in the theory of recognition of discrete objects associated with the General scheme of construction of the most complex resulting logical classification tree. The General step-by-step scheme of construction of such tree is offered, and the estimation of complexity of the received graph-circuit models is given. Numerical estimates in the long term allow us to develop effective models of minimization schemes of logical classification trees. The result obtained is of fundamental importance in the problem of estimating the stability of the maximum logical classification tree with respect to the permutation of tiers and the effect of such a permutation on the overall complexity of the tree. The work is relevant for all methods of pattern recognition in which the resulting classification function can be represented as a logical tree.

Keywords: tasks of pattern recognition, logical tree, graph-scheme of the model