Interfering Paths in Decision Trees: A Note on Deodata Predictors

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

A technique for improving the prediction accuracy of decision trees is proposed. It consists in evaluating the tree's branches in parallel over multiple paths. The technique enables predictions that are more aligned with the ones generated by the nearest neighborhood variant of the deodata algorithms. The technique also enables the hybridization of the decision tree algorithm with the nearest neighborhood variant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2022

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

A tie-breaking method is proposed for choosing the predicted class, or o...
research
10/13/2021

Sub-Setting Algorithm for Training Data Selection in Pattern Recognition

Modern pattern recognition tasks use complex algorithms that take advant...
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
10/26/2020

An Approach to Evaluating Learning Algorithms for Decision Trees

Learning algorithms produce software models for realising critical class...
research
03/27/2013

Multiple decision trees

This paper describes experiments, on two domains, to investigate the eff...
research
05/10/2023

Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables from Closed Classes

In this paper, we consider classes of decision tables with 0-1-decisions...
research
02/06/2019

Finding Good Itemsets by Packing Data

The problem of selecting small groups of itemsets that represent the dat...

Please sign up or login with your details

Forgot password? Click here to reset