Skip to main content

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

  • 349 Accesses

Abstract

This chapter contains definitions of the notions of decision table with many-valued decisions, decision tree schema, deterministic, nondeterministic, and strongly nondeterministic decision trees for decision tables, and complexity function.

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. Boutell, M.R., Luo, J., Shen, X., Brown, C.M.: Learning multi-label scene classification. Pattern Recognit. 37(9), 1757–1771 (2004)

    Article  Google Scholar 

  2. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth and Brooks, Monterey, CA (1984)

    Google Scholar 

  3. Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21–43 (2002)

    Article  MathSciNet  Google Scholar 

  4. Moshkov, M.: On the uniqueness of dead-end tests for recognition problems with linear decision rules. In: Markov, A.A. (ed.) Combinatorial-Algebraic Methods in Applied Mathematics (in Russian), pp. 97–109. Gorky University Press, Gorky (1981)

    Google Scholar 

  5. Moshkov, M.: About the depth of decision trees computing Boolean functions. Fundam. Inform. 22(3), 203–215 (1995)

    Article  MathSciNet  Google Scholar 

  6. Moshkov, M.: Lower bounds for the time complexity of deterministic conditional tests. Disk. Mat. (in Russian) 8(3), 98–110 (1996). https://doi.org/10.4213/dm538

  7. Moshkov, M.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III, Lecture Notes in Computer Science, vol. 3400, pp. 244–459. Springer, Berlin (2005)

    Google Scholar 

  8. 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

  9. Rokach, L., Maimon, O.: Data Mining with Decision Trees: Theory and Applications. World Scientific Publishing, River Edge, NJ (2008)

    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). Basic Definitions and Notation. 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_2

Download citation

Publish with us

Policies and ethics