A syntactic characterization of bounded-rank decision trees in terms of decision lists

DOI10.1051/ita/1997310201491zbMath0876.68092OpenAlexW1518149225MaRDI QIDQ4349779

Nicola Galesi

Publication date: 12 November 1997

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92556

zbMATH Keywords

decision listsbounded rank decision trees

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Rank-\(r\) decision trees are a subclass of \(r\)-decision lists
• Learning decision trees from random examples

This page was built for publication: A syntactic characterization of bounded-rank decision trees in terms of decision lists