Backtrack Tie-Breaking for Decision Trees: A Note on Deodata Predictors

02/05/2022
by   Cristian Alb, et al.
0

A tie-breaking method is proposed for choosing the predicted class, or outcome, in a decision tree. The method is an adaptation of a similar technique used for deodata predictors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2022

Interfering Paths in Decision Trees: A Note on Deodata Predictors

A technique for improving the prediction accuracy of decision trees is p...
research
11/06/2015

Finding structure in data using multivariate tree boosting

Technology and collaboration enable dramatic increases in the size of ps...
research
04/26/2018

Handling Missing Values using Decision Trees with Branch-Exclusive Splits

In this article we propose a new decision tree construction algorithm. T...
research
06/12/2017

Random Forests, Decision Trees, and Categorical Predictors: The "Absent Levels" Problem

One of the advantages that decision trees have over many other models is...
research
02/13/2017

metboost: Exploratory regression analysis with hierarchically clustered data

As data collections become larger, exploratory regression analysis becom...
research
06/11/2023

Well-Calibrated Probabilistic Predictive Maintenance using Venn-Abers

When using machine learning for fault detection, a common problem is the...
research
04/09/2018

Sample-Derived Disjunctive Rules for Secure Power System Operation

Machine learning techniques have been used in the past using Monte Carlo...

Please sign up or login with your details

Forgot password? Click here to reset