Decision trees based on 1-consequences

DOI10.1016/J.DAM.2021.07.017MaRDI QIDQ2043377zbMATH OpenOpenAlexFDO

Authors Mikhail Moshkov

Publication date 2 August 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

1-consequencedecision treedepthinformation system

Mathematics Subject Classification ID

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

Cites work

• Complexity measures and decision tree complexity: a survey.
• Constructing optimal binary decision trees is NP-complete
• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 3903826 (Why is no real title available?)
• scientific article; zbMATH DE number 2064222 (Why is no real title available?)
• scientific article; zbMATH DE number 3797499 (Why is no real title available?)
• Information systems theoretical foundations
• Multidimensional Searching Problems
• Transactions on Rough Sets III

Cited in

(6)

• A note on computing the asymptotic form of a limited sequence of decision trees
• Generation and enumeration of atoms in the presence of logical constraints through binary trees
• scientific article; zbMATH DE number 2053217 (Why is no real title available?)
• scientific article; zbMATH DE number 2064222 (Why is no real title available?)
• scientific article; zbMATH DE number 1455627 (Why is no real title available?)
• scientific article; zbMATH DE number 1931886 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043377)