Indecision Trees: Learning Argument-Based Reasoning under Quantified Uncertainty
arXiv:2206.12252 · doi:10.1117/12.2652598
Abstract
Using Machine Learning systems in the real world can often be problematic, with inexplicable black-box models, the assumed certainty of imperfect measurements, or providing a single classification instead of a probability distribution. This paper introduces Indecision Trees, a modification to Decision Trees which learn under uncertainty, can perform inference under uncertainty, provide a robust distribution over the possible labels, and can be disassembled into a set of logical arguments for use in other reasoning systems.
arXiv comment12 pages, 1 figure