Skip to main content

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

  • Chapter
  • First Online:
Comparative Analysis of Deterministic and Nondeterministic Decision Trees

Part of the book series: Intelligent Systems Reference Library ((ISRL,volume 179))

  • 325 Accesses

Abstract

In this chapter, for complexity functions having the properties \(\varLambda 1 \), \(\varLambda 2\), and \(\varLambda 3\), 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Moshkov, M.: On conditional tests. Sov. Phys. Dokl. 27, 528–530 (1982)

    MATH  Google Scholar 

  2. Moshkov, M.: Conditional tests. In: Yablonskii, S.V. (ed.) Problemy Kibernetiki (in Russian), vol. 40, pp. 131–170. Nauka Publishers, Moscow (1983)

    Google Scholar 

  3. Moshkov, M.: Bounds on complexity and algorithms for construction of deterministic conditional tests. In: Mat. Vopr. Kibern. (in Russian), vol. 16, pp. 79–124. Fizmatlit, Moscow (2007). http://library.keldysh.ru/mvk.asp?id=2007-79

  4. Quinlan, J.R.: Discovering rules by induction from large collections of examples. In: D. Michie (ed.) Experts Systems in the Microelectronic Age, pp. 168–201. Edinburg University Press (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mikhail Moshkov .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Moshkov, M. (2020). Upper Bounds on Complexity and Algorithms for Construction of Deterministic Decision Trees for Decision Tables. First Approach. In: Comparative Analysis of Deterministic and Nondeterministic Decision Trees. Intelligent Systems Reference Library, vol 179. Springer, Cham. https://doi.org/10.1007/978-3-030-41728-4_4

Download citation

Publish with us

Policies and ethics