Interfering Paths in Decision Trees: A Note on Deodata Predictors
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Backtrack Tie-Breaking for Decision Trees: A Note on Deodata Predictors
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.
Probabilistic Alternatives to the Gower Distance: A Note on Deodata Predictors
A probabilistic alternative to the Gower distance is proposed. The probabilistic distance enables the realization of a generic deodata predictor.
Succinct Explanations With Cascading Decision Trees
The decision tree is one of the most popular and classical machine learning models from the 1980s. However, in many practical applications, decision trees tend to generate decision paths with excessive depth. Long decisi…
ClassificationGeneral ClassificationMissing ValuesOn Tackling Explanation Redundancy in Decision Trees
Decision trees (DTs) epitomize the ideal of interpretability of machine learning (ML) models. The interpretability of decision trees motivates explainability approaches by so-called intrinsic interpretability, and it is …
On the utility of feature selection in building two-tier decision trees
Nowadays, feature selection is frequently used in machine learning when there is a risk of performance degradation due to overfitting or when computational resources are limited. During the feature selection process, the…
feature selection