# Greedy Algorithm for Inference of Decision Trees from Decision Rule Systems

arXiv: https://arxiv.org/abs/2401.06793 · HTML: https://mlsanity.com/paper/2401.06793/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 41 references that are in the map.
- First posted on arXiv 8 Jan 2024.

## Builds on (most cited first, 1 of 1)

- [Construction of Decision Trees and Acyclic Decision Graphs from Decision Rule Systems](https://mlsanity.com/paper/2305.01721/) (2023)

## Abstract (arXiv)

Decision trees and decision rule systems play important roles as classifiers, knowledge representation tools, and algorithms. They are easily interpretable models for data analysis, making them widely used and studied in computer science. Understanding the relationships between these two models is an important task in this field. There are well-known methods for converting decision trees into systems of decision rules. In this paper, we consider the inverse transformation problem, which is not so simple. Instead of constructing an entire decision tree, our study focuses on a greedy polynomial time algorithm that simulates the operation of a decision tree on a given tuple of attribute values.