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://bakhtiniada.ru/1054-6618/article/view/194976
DOI: https://doi.org/10.1134/S1054661817010047
ID: 194976

Цитировать

Полный текст

Открытый доступ
Доступ закрыт

Доступ предоставлен
Доступ закрыт

Только для подписчиков

Аннотация
Об авторах
Список литературы
Дополнительные файлы
Статистика

Аннотация

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.