Context. A general problem of constructing logical recognition/classification trees has been analyzed. Logical classification trees are the object of the present study. The subject of the study are the relevant methods and algorithms of logical classification trees. Objective. The goal of this work is to develop a simple and efficient method of constructing logical tree-like models on the basis of classification trees for training discrete information selection characterized by a structure of constructed logical classification trees from elementary attributes estimated on the basis of their informativeness calculation functional. Method. A general method of constructing logical classification trees is suggested that constructs a tree-like structure for a given initial training selection comprising a set of elementary attributes estimated at each step of constructing a model according to the above selection. In other words, a method of constructing logical classification trees is suggested with the main idea of approximating the initial selection of an arbitrary volume by the elementary attribute set. This method during the current logical tree (node) vertex formation provides selecting the most informative (high-quality) elementary attributes from the initial set. Such approach at constructing the resulting classification tree allows one to reduce essentially the tree size and complexity (i.e. the total number of branches and structural layers) and increase the quality of its further analysis (interpretability). The method of constructing logical classification trees suggested by us enables one to construct the tree-like models for a wide class of artificial intellect theory problems. Results. The method developed and presented in this work has received a software realization and was studied when solving a problem of classifying the geological type data characterized by a large-dimension attribute space. Conclusions. Experiments carried out in this work have confirmed the efficiency of the software suggested and demonstrate the possibility of its use for solving a wide spectrum of applied recognition and classification problems. The outlook of the further studies may be related to creating a limited method of logical classification tree by introducing the stopping criterion for the logical tree construction procedure according to the structure depth, its program realization optimization, as well as to the experimental study of this method in a wider circle of applied problems.
The paper is dedicated to algorithms for constructing a logical tree of classification. Nowadays, there exist many algorithms for constructing logical classification trees. However, all of them, as a rule, are reduced to the construction of a single classification tree based on the data of a fixed training sample. There are very few algorithms for constructing recognition trees that are designed for large data sets. It is obvious that such sets have objective factors associated with the peculiarities of the generation of such complex structures, methods of working with them and storage. In this paper, we focus on the description of the algorithm for constructing classification trees for a large training set and show the way to the possibility of a uniform description of a fixed class of recognition trees. A simple, effective, economical method of constructing a logical classification tree of the training sample allows you to provide the necessary speed, the level of complexity of the recognition scheme, which guarantees a simple and complete recognition of discrete objects.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.