Bounds on Average Weighted Depth of Decision Trees

  • Authors:

  • Mikhail Moshkov;Igor Chikalov

  • Affiliations:

  • Research Institute for Applied Mathematics and Cybernetics of Nizhni Novgorod State University, 10, Uljanova St., Nizhni Novgorod, 603005, Russia. moshkov@nnucnit.unn.ac.ru;Faculty of Calculating Mathematics and Cybernetics of Nizhni Novgorod State University 23, Gagarina Av., Nizhni Novgorod, 603600, Russia

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.