LOGICAL CLASSIFICATION TREES IN RECOGNITION PROBLEMS
Igor Povhan
igor.povkhan@uzhnu.edu.uaUzhgorod National University, Department of Software Systems (Ukraine)
http://orcid.org/0000-0002-7034-8702
Abstract
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.
Keywords:
pattern recognition problems, logical tree, graph-scheme models, recognition systemReferences
Povhan I.: General scheme for constructing the most complex logical tree of classification in pattern recognition discrete objects. Electronics and information technologies 11/2019, 112–117.
DOI: https://doi.org/10.30970/eli.11.7
Google Scholar
Quinlan J.R.: Induction of Decision Trees. Machine Learning 1/2008, 181–222.
Google Scholar
Vasilenko Y.A, Kuhayivsky A.I, Papp S.A.: Construction and optimization of recongnizing systems. Information Technologies and Systems 1(T2)/1999, 122–125.
Google Scholar
Vasilenko Y.A., Vashchuk F.G., Povhan I.F.: Overall assessment of minimization of logical tree. European Journal of Enterprise Technologies 1(55)/2012, 29–33.
Google Scholar
Vasilenko Y.A., Vashchuk F.G., Povhan I.F.: The problem of estimating the complexity of the logic trees, recognition and general method optimization. European Journal of Enterprise Technologies 6/4(54)/2011, 24–28.
Google Scholar
Vtogoff P.E.: Incremental Induction of Decision Trees. Machine Learning 4/2009, 161−186.
Google Scholar
Zheng Z., Kohavi R., Mason L.: Real world performance of association rule algorithms. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2008, 401–406.
Google Scholar
Authors
Igor Povhanigor.povkhan@uzhnu.edu.ua
Uzhgorod National University, Department of Software Systems Ukraine
http://orcid.org/0000-0002-7034-8702
Statistics
Abstract views: 271PDF downloads: 182
License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
