On algorithm for constructing of decision trees with minimal depth

Mikhail Moshkov, Igor Chikalov

Research output: Contribution to journalArticlepeer-review

35 Scopus citations


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
Issue number3
StatePublished - Jan 1 2000
Externally publishedYes

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


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

Cite this