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

arXiv: https://arxiv.org/abs/2202.03865 · HTML: https://mlsanity.com/paper/2202.03865/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 3 references that are in the map.
- First posted on arXiv 5 Feb 2022.

## Builds on (most cited first, 1 of 1)

- [Collapsing the Decision Tree: the Concurrent Data Predictor](https://mlsanity.com/paper/2108.03887/) (2021)

## Built on by (most cited first, 1 of 1)

- [Accuracy Convergent Field Predictors](https://mlsanity.com/paper/2205.03712/) (2022)

## Abstract (arXiv)

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.