Upper and lower bounds on minimal average weighted depth and minimal average depth of decision trees over arbitrary information systems are considered. In proofs methods of test theory and rough set theory are used.
Bibliographical noteGenerated from Scopus record by KAUST IRTS on 2023-09-21
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Algebra and Number Theory
- Theoretical Computer Science
- Information Systems