Minimizing depth of decision trees with hypotheses

DOI10.1007/978-3-030-87334-9_11zbMath1495.68189OpenAlexW3200663600MaRDI QIDQ2670891

Shahid Hussain, Mohammad Azad, Igor Chikalov, Mikhail Ju. Moshkov

Publication date: 1 June 2022

Full work available at URL: http://hdl.handle.net/10754/671321

zbMATH Keywords

hypothesisdepthdecision tree

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• Rudiments of rough sets
• Learning regular sets from queries and counterexamples
• Queries revisited.
• Queries and concept learning
• A theory of the learnable
• Rough sets
• Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions

This page was built for publication: Minimizing depth of decision trees with hypotheses