QUBO Decision Tree: Annealing Machine Extends Decision Tree Splitting

03/17/2023
by   Koichiro Yawata, et al.
0

This paper proposes an extension of regression trees by quadratic unconstrained binary optimization (QUBO). Regression trees are very popular prediction models that are trainable with tabular datasets, but their accuracy is insufficient because the decision rules are too simple. The proposed method extends the decision rules in decision trees to multi-dimensional boundaries. Such an extension is generally unimplementable because of computational limitations, however, the proposed method transforms the training process to QUBO, which enables an annealing machine to solve this problem.

READ FULL TEXT
research
01/27/2021

Decision Machines: Interpreting Decision Tree as a Model Combination Method

Based on decision trees, it is efficient to handle tabular data. Convent...
research
04/20/2020

Sparse Oblique Decision Tree for Power System Security Rules Extraction and Embedding

Increasing the penetration of variable generation has a substantial effe...
research
03/29/2019

Online Multi-target regression trees with stacked leaf models

The amount of available data raises at large steps. Developing machine l...
research
06/18/2017

Data set operations to hide decision tree rules

This paper focuses on preserving the privacy of sensitive patterns when ...
research
01/10/2022

A Study on Mitigating Hard Boundaries of Decision-Tree-based Uncertainty Estimates for AI Models

Outcomes of data-driven AI models cannot be assumed to be always correct...
research
10/18/2017

On Using Linear Diophantine Equations to Tune the extent of Look Ahead while Hiding Decision Tree Rules

This paper focuses on preserving the privacy of sensitive pat-terns when...
research
12/19/2019

Meta Decision Trees for Explainable Recommendation Systems

We tackle the problem of building explainable recommendation systems tha...

Please sign up or login with your details

Forgot password? Click here to reset