LGFeb 5, 2022
Backtrack Tie-Breaking for Decision Trees: A Note on Deodata Predictors
arXiv:2202.03865v21 citations
Originality Synthesis-oriented
AI Analysis
This is an incremental improvement for decision tree algorithms, addressing a specific technical issue.
The paper tackles the problem of tie-breaking in decision trees by proposing a method adapted from deodata predictors, but it does not provide concrete results or numbers.
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.