Bounds on Average Weighted Depth of Decision Trees
Mikhail Moshkov, Igor Chikalov · Fundamenta Informaticae · 1997
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.