Indecision Trees: Learning Argument-Based Reasoning under Quantified Uncertainty

06/23/2022
by   Jonathan S. Kent, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2022

Combining Predictions under Uncertainty: The Case of Random Decision Trees

A common approach to aggregate classification estimates in an ensemble o...
research
06/26/2011

Temporal Decision Trees: Model-based Diagnosis of Dynamic Systems On-Board

The automatic generation of decision trees based on off-line reasoning o...
research
03/03/2021

Extracting Optimal Explanations for Ensemble Trees via Logical Reasoning

Ensemble trees are a popular machine learning model which often yields h...
research
02/21/2023

Variational Boosted Soft Trees

Gradient boosting machines (GBMs) based on decision trees consistently d...
research
08/21/2020

Rectified Decision Trees: Exploring the Landscape of Interpretable and Effective Machine Learning

Interpretability and effectiveness are two essential and indispensable r...
research
07/03/2020

On Symbolically Encoding the Behavior of Random Forests

Recent work has shown that the input-output behavior of some machine lea...
research
02/09/2011

From Machine Learning to Machine Reasoning

A plausible definition of "reasoning" could be "algebraically manipulati...

Please sign up or login with your details

Forgot password? Click here to reset