Skip to main content

Local and Global Approaches to Study of Decision and Inhibitory Trees and Rule Systems

  • Chapter
  • First Online:

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

Abstract

This chapter is devoted to the study of time complexity of decision and inhibitory trees and rule systems over arbitrary sets of attributes represented by information systems.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Laskowski, M.: Vapnik-Chervonenkis classes of definable sets. J. Lond. Math. Soc. 45, 377–384 (1992)

    Article  MathSciNet  Google Scholar 

  2. Moshkov, M.: Decision Trees. Theory and Applications (in Russian). Nizhny Novgorod University Publishers, Nizhny Novgorod (1994)

    Google Scholar 

  3. Moshkov, M.: Unimprovable upper bounds on complexity of decision trees over information systems. Found. Comput. Decis. Sci. 21, 219–231 (1996)

    MathSciNet  MATH  Google Scholar 

  4. Moshkov, M.: On time complexity of decision trees. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery 1: Methodology and Applications. Studies in Fuzziness and Soft Computing, vol. 18, pp. 160–191. Physica-Verlag (1998)

    Google Scholar 

  5. Moshkov, M.: Classification of infinite information systems depending on complexity of decision trees and decision rule systems. Fundam. Inf. 54, 345–368 (2003)

    MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  7. Moshkov, M., Zielosko, B.: Combinatorial Machine Learning – A Rough Set Approach. Studies in Computational Intelligence, vol. 360. Springer, Heidelberg (2011)

    Google Scholar 

  8. Pawlak, Z.: Information systems theoretical foundations. Inf. Syst. 6(3), 205–218 (1981)

    Article  Google Scholar 

  9. Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264–280 (1971)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fawaz Alsolami .

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Alsolami, F., Azad, M., Chikalov, I., Moshkov, M. (2020). Local and Global Approaches to Study of Decision and Inhibitory Trees and Rule Systems. In: Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions. Intelligent Systems Reference Library, vol 156. Springer, Cham. https://doi.org/10.1007/978-3-030-12854-8_15

Download citation

Publish with us

Policies and ethics