Upper Bounds on Complexity and Algorithms for Construction of Deterministic Decision Trees for Decision Tables. First Approach

Mikhail Moshkov*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, for complexity functions having the properties upper bounds on the minimum complexity and algorithms for construction of deterministic decision trees for decision tables are considered. These bounds and algorithms are based on the use of so-called difference-bounded uncertainty measures for decision tables.

Original languageEnglish (US)
Title of host publicationIntelligent Systems Reference Library
PublisherSpringer
Pages37-63
Number of pages27
DOIs
StatePublished - 2020

Publication series

NameIntelligent Systems Reference Library
Volume179
ISSN (Print)1868-4394
ISSN (Electronic)1868-4408

ASJC Scopus subject areas

  • General Computer Science
  • Information Systems and Management
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'Upper Bounds on Complexity and Algorithms for Construction of Deterministic Decision Trees for Decision Tables. First Approach'. Together they form a unique fingerprint.

Cite this