Greedy algorithm with weights for decision tree construction

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

An approximate algorithm for minimization of weighted depth of decision trees is considered. A bound on accuracy of this algorithm is obtained which is unimprovable in general case. Under some natural assumptions on the class NP, the considered algorithm is close (from the point of view of accuracy) to best polynomial approximate algorithms for minimization of weighted depth of decision trees.
Original languageEnglish (US)
Pages (from-to)285-292
Number of pages8
JournalFundamenta Informaticae
Volume104
Issue number3
DOIs
StatePublished - Dec 1 2010

ASJC Scopus subject areas

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

Fingerprint

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

Cite this