On algorithm for constructing of decision trees with minimal depth

Mikhail Moshkov*, Igor Chikalov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

33 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 languageEnglish (US)
Pages (from-to)295-299
Number of pages5
JournalFundamenta Informaticae
Volume41
Issue number3
StatePublished - Feb 1 2000

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'On algorithm for constructing of decision trees with minimal depth'. Together they form a unique fingerprint.

Cite this