Skip to main content

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

  • 326 Accesses

Abstract

In this chapter, for restricted sccf-triples \(\tau \), we study functions \(\hat{\varPsi }_{\tau }^{bc}\), \(b,c \in \{i,d,a,s\}\), located in the matrix of upper local bounds for the triple \(\tau \) on the main diagonal and below. For each of these functions, we list all possible upper types and consider criterion for each such type. In several cases, we give upper and lower bounds for the considered functions.

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. Alsolami, F., Azad, M., Chikalov, I., Moshkov, M.: Decision and Inhibitory Trees and Rules for Decision Tables with Many-valued Decisions, Intelligent Systems Reference Library, vol. 156. Springer, Cham (2020)

    Google Scholar 

  2. Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity, Local approach. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets IV, Lecture Notes in Computer Science, vol. 3700, pp. 125–143. Springer, Berlin (2005)

    Google Scholar 

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

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

    Book  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). Functions on Main Diagonal and Below. 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_11

Download citation

Publish with us

Policies and ethics