On full regression decision trees

I. E. Genrikhov; E. V. Djukova; V. I. Zhuravlev

doi:10.1134/S1054661817010047

On full regression decision trees

作者: Genrikhov I.E.¹, Djukova E.V.², Zhuravlev V.I.³
隶属关系:
1. LLC Mobile Park IT
2. FRC “Computer Science and Control,”
3. Moscow State University
期: 卷 27, 编号 1 (2017)
页面: 1-7
栏目: Mathematical Method in Pattern Recognition
URL: https://journals.rcsi.science/1054-6618/article/view/194976
DOI: https://doi.org/10.1134/S1054661817010047
ID: 194976

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

详细
作者简介
参考
补充文件
统计

详细

One of the central problems of machine learning is considered—the regression restoration problem. A qualitatively new regression decision tree (RDT) is proposed that is based on the concept of a full decision tree (FDT). Earlier, a similar construction of a decision tree (DT) was successfully tested on the problem of classification by precedents, whose statement is close to the problem considered. The results of testing the model of a full RDT (FRDT) on real data are presented.