Abstract
The work is devoted to the problems of the theory of recognition of discrete objects, which are associated with a general assessment of the complexity of the resulting logical classification tree. A general estimation of the complexity of the obtained graph-circuit models in the form of logical trees is given. Numerical estimates in the long term allow us to develop effective models of schemes for minimization of logical classification trees, and therefore to obtain the minimum form of the system of recognition of discrete objects. The results obtained are fundamentally important in problems that are related to logical classification trees. The work is relevant for all methods of pattern recognition in which the resulting classification function can be represented as a logical tree. Refs.: 11 titles.Keywords: methods of pattern recognition; logical tree; graph-circuit models; estimation of complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the National Technical University "KhPI" A series of "Information and Modeling"
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
