On full regression decision trees
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...
Gespeichert in:
Veröffentlicht in: | Pattern recognition and image analysis 2017, Vol.27 (1), p.1-7 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 1054-6618 1555-6212 |
DOI: | 10.1134/S1054661817010047 |