Greedy algorithm of decision tree construction for real data tables

Mikhail Ju Moshkov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


In the paper a greedy algorithm for minimization of decision tree depth is described and bounds on the algorithm precision are considered. This algorithm is applicable to data tables with both discrete and continuous variables which can have missing values. Under some natural assumptions on the class N P and on the class of considered tables, the algorithm is, apparently, close to best approximate polynomial algorithms for minimization of decision tree depth.

Original languageEnglish (US)
Pages (from-to)161-168
Number of pages8
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
StatePublished - 2004
Externally publishedYes


  • Data table
  • Decision table
  • Decision tree
  • Depth

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Greedy algorithm of decision tree construction for real data tables'. Together they form a unique fingerprint.

Cite this