On algorithm for constructing of decision trees with minimal depth

Mikhail Moshkov; Igor Chikalov

doi:10.3233/fi-2000-41302

On algorithm for constructing of decision trees with minimal depth

Mikhail Moshkov^*, Igor Chikalov

^*Corresponding author for this work

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

35 Scopus citations

Abstract

An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.

Original language	English (US)
Pages (from-to)	295-299
Number of pages	5
Journal	Fundamenta Informaticae
Volume	41
Issue number	3
DOIs	https://doi.org/10.3233/fi-2000-41302
State	Published - Feb 2000
Externally published	Yes

ASJC Scopus subject areas

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

Access to Document

10.3233/fi-2000-41302

Cite this

@article{7728eafcfefb4ae4ac06f32053165476,

title = "On algorithm for constructing of decision trees with minimal depth",

abstract = "An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.",

author = "Mikhail Moshkov and Igor Chikalov",

year = "2000",

month = feb,

doi = "10.3233/fi-2000-41302",

language = "English (US)",

volume = "41",

pages = "295--299",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press",

number = "3",

}

TY - JOUR

T1 - On algorithm for constructing of decision trees with minimal depth

AU - Moshkov, Mikhail

AU - Chikalov, Igor

PY - 2000/2

Y1 - 2000/2

N2 - An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.

AB - An algorithm is considered which for a given decision table constructs a decision tree with minimal depth. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.

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

U2 - 10.3233/fi-2000-41302

DO - 10.3233/fi-2000-41302

M3 - Article

AN - SCOPUS:0039177551

SN - 0169-2968

VL - 41

SP - 295

EP - 299

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

IS - 3

ER -

On algorithm for constructing of decision trees with minimal depth

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this