Email this article About methods of Synthesis Complete Regression Decision Trees
- Authors: Genrikhov I.E.1, Djukova E.V.2
-
Affiliations:
- Mobile Park Ltd
- Federal Research Center Computer Science and Control, Russian Academy of Sciences
- Issue: Vol 29, No 3 (2019)
- Pages: 457-470
- Section: Applied Problems
- URL: https://journals.rcsi.science/1054-6618/article/view/195646
- DOI: https://doi.org/10.1134/S1054661819030040
- ID: 195646
Cite item
Open Access
Access granted
Subscription Access
Abstract
Abstract—Algorithms for regression problem on the basis of complete decision trees are examined in the paper. The examined structure of the decision tree makes it possible to consider all features meeting the branching criterion in each special vertex of the tree. New algorithms for synthesizing complete regression decisions trees are presented. The developed algorithms are tested on real problems and it is revealed that the algorithms are efficient.
About the authors
I. E. Genrikhov
Mobile Park Ltd
Author for correspondence.
Email: ingvar1485@rambler.ru
Russian Federation, Khimki, Moscow region
E. V. Djukova
Federal Research Center Computer Science and Control, Russian Academy of Sciences
Author for correspondence.
Email: edjukova@mail.ru
Russian Federation, Moscow
Supplementary files
