Decision trees based on 1-consequences

DOI10.1016/j.dam.2021.07.017OpenAlexW3185536754MaRDI QIDQ2043377

Mikhail Ju. Moshkov

Publication date: 2 August 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.07.017

zbMATH Keywords

depthdecision treeinformation system1-consequence

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Information systems theoretical foundations
• Constructing optimal binary decision trees is NP-complete
• Complexity measures and decision tree complexity: a survey.
• Multidimensional Searching Problems
• Transactions on Rough Sets III
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decision trees based on 1-consequences