Global Evaluation for Decision Tree Learning

08/09/2022
by   Fabian Spaeh, et al.
0

We transfer distances on clusterings to the building process of decision trees, and as a consequence extend the classical ID3 algorithm to perform modifications based on the global distance of the tree to the ground truth–instead of considering single leaves. Next, we evaluate this idea in comparison with the original version and discuss occurring problems, but also strengths of the global approach. On this basis, we finish by identifying other scenarios where global evaluations are worthwhile.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/13/2014

The New Approach on Fuzzy Decision Trees

Decision trees have been widely used in machine learning. However, due t...
research
01/18/2021

Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration

A decision tree looks like a simple computational graph without cycles, ...
research
11/03/2010

Soil Classification Using GATree

This paper details the application of a genetic programming framework fo...
research
06/25/2020

The Max-Cut Decision Tree: Improving on the Accuracy and Running Time of Decision Trees

Decision trees are a widely used method for classification, both by them...
research
11/08/2019

An Experimental Comparison of Old and New Decision Tree Algorithms

This paper presents a detailed comparison of a recently proposed algorit...
research
02/27/2017

Memory-Efficient Global Refinement of Decision-Tree Ensembles and its Application to Face Alignment

Ren et al. recently introduced a method for aggregating multiple decisio...
research
04/03/2020

Unpack Local Model Interpretation for GBDT

A gradient boosting decision tree (GBDT), which aggregates a collection ...

Please sign up or login with your details

Forgot password? Click here to reset