Bounds on average weighted depth of decision trees

Mikhail Moshkov; Igor Chikalov

doi:10.3233/fi-1997-31204

Bounds on average weighted depth of decision trees

Mikhail Moshkov^*, Igor Chikalov

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

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.

Original language	English (US)
Pages (from-to)	145-156
Number of pages	12
Journal	Fundamenta Informaticae
Volume	31
Issue number	2
DOIs	https://doi.org/10.3233/fi-1997-31204
State	Published - Aug 1997
Externally published	Yes

Keywords

Average weighted depth
Decision tree
Information system

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Algebra and Number Theory
Computational Theory and Mathematics

Access to Document

10.3233/fi-1997-31204

Cite this

@article{ffc172da157e4ea0ab69cd528324d840,

title = "Bounds on average weighted depth of decision trees",

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.",

keywords = "Average weighted depth, Decision tree, Information system",

author = "Mikhail Moshkov and Igor Chikalov",

year = "1997",

month = aug,

doi = "10.3233/fi-1997-31204",

language = "English (US)",

volume = "31",

pages = "145--156",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press",

number = "2",

}

TY - JOUR

T1 - Bounds on average weighted depth of decision trees

AU - Moshkov, Mikhail

AU - Chikalov, Igor

PY - 1997/8

Y1 - 1997/8

N2 - 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.

AB - 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.

KW - Average weighted depth

KW - Decision tree

KW - Information system

UR - http://www.scopus.com/inward/record.url?scp=0031198040&partnerID=8YFLogxK

U2 - 10.3233/fi-1997-31204

DO - 10.3233/fi-1997-31204

M3 - Article

AN - SCOPUS:0031198040

SN - 0169-2968

VL - 31

SP - 145

EP - 156

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 2

ER -

Bounds on average weighted depth of decision trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this