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

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 - Jan 1 2000
Externally published	Yes

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

Access to Document

10.3233/fi-2000-41302

Cite this

@article{9bbf7454c19549af9a6d6e9741d3254c,

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

note = "Generated from Scopus record by KAUST IRTS on 2023-09-21",

year = "2000",

month = jan,

day = "1",

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

N1 - Generated from Scopus record by KAUST IRTS on 2023-09-21

PY - 2000/1/1

Y1 - 2000/1/1

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 - https://www.medra.org/servlet/aliasResolver?alias=iospress&doi=10.3233/FI-2000-41302

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

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

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this