Consecutive optimization of decision trees concerning various complexity measures

Mikhail Ju Moshkov, Igor V. Chikalov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations


In the paper algorithms are considered which allow to optimize decision trees consecutively againsts relatively different criterions. For decision tables over an arbitrary infinite restricted information system, these algorithms have polynomial time complexity.
Original languageEnglish (US)
Title of host publicationFundamenta Informaticae
Number of pages10
StatePublished - Jun 1 2004
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 'Consecutive optimization of decision trees concerning various complexity measures'. Together they form a unique fingerprint.

Cite this