Bounds on average weighted depth of decision trees

Mikhail Moshkov, Igor Chikalov

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


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.
Original languageEnglish (US)
Pages (from-to)145-156
Number of pages12
JournalFundamenta Informaticae
Issue number2
StatePublished - Jan 1 1997
Externally publishedYes

Bibliographical note

Generated 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


Dive into the research topics of 'Bounds on average weighted depth of decision trees'. Together they form a unique fingerprint.

Cite this