Topological recursive fitting trees : A framework for interpretable regression extending decision trees
Many real-world machine learning applications need interpretation of an algorithm output. The simplicity of some of the most fundamental machine learning algorithms for regression, such as linear regression or decision trees, facilitates interpretation. However, they fall short when facing complex (...
Main Author: | Tadros, Alexandre |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för elektroteknik och datavetenskap (EECS)
2020
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-272130 |
Similar Items
-
Optimizations for uncertainty prediction on streams with decision trees
by: Manninger, Mátyás
Published: (2018) -
Enhancing decision tree accuracy and compactness with improved categorical split and sampling techniques
by: Millerand, Gaëtan
Published: (2020) -
Integrating Reinforcement Learning into Behavior Trees by Hierarchical Composition
by: Kartasev, Mart
Published: (2019) -
Spork : Move-enabled structured merge for Java with GumTree and 3DM
by: Larsén, Simon
Published: (2020) -
Monto Carlo Tree Search in Real Time Strategy Games with Applications to Starcraft 2
by: Granberg Orrevall, Aron
Published: (2019)