Skip to main content

Infinite Binary Information Systems. Decision Trees of Types 4 and 5

  • Chapter
  • First Online:
Decision Trees with Hypotheses

Abstract

In this chapter, based on results of exact learning, test theory, and rough set theory, we study arbitrary infinite binary information systems each of which consists of an infinite set of elements and an infinite set of two-valued functions (attributes) defined on the set of elements. We consider the notion of a problem over information system, which is described by a finite number of attributes: for a given element, we should recognize values of these attributes. As algorithms for problem solving, we consider decision trees of two types: (4) using only proper hypotheses (an analog of proper equivalence queries from exact learning), and (5) using both attributes and proper hypotheses. As time complexity, we study the depth of decision trees. In the worst case, with the growth of the number of attributes in the problem description, the minimum depth of decision trees of both types either is bounded from above by a constant or grows as a logarithm, or linearly. Based on these results and results obtained in Chap. 7 for attributes and arbitrary hypotheses, we divide the set of all infinite binary information systems into seven complexity classes.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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. Angluin, D.: Queries revisited. Theor. Comput. Sci. 313(2), 175–194 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hegedüs, T.: Generalized teaching dimensions and the query complexity of learning. In: Maass W. (ed.) Eight Annual Conference on Computational Learning Theory, COLT 1995, Santa Cruz, CA, USA, 5–8 July 1995, pp. 108–117. ACM (1995)

    Google Scholar 

  3. Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., Wilkins, D.: How many queries are needed to learn? J. ACM 43(5), 840–862 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Moshkov, M.: Test theory and problems of machine learning. In: International School-Seminar on Discrete Mathematics and Mathematical Cybernetics, Ratmino, Russia, 31 May–3 June 2001, pp. 6–10. MAX Press, Moscow (2001)

    Google Scholar 

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

  6. Moshkov, M.: Exact learning and test theory. arXiv:2201.04506 [cs.CC] (2022). https://doi.org/10.48550/arXiv.2201.04506

  7. Sauer, N.: On the density of families of sets. J. Comb. Theory (A) 13, 145–147 (1972)

    Google Scholar 

  8. Shelah, S.: A combinatorial problem; stability and order for models and theories in infinitary languages. Pac. J. Math. 41, 241–261 (1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Mohammad Azad or Mikhail Moshkov .

Rights and permissions

Reprints and permissions

Copyright information

© 2022 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

Azad, M., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B. (2022). Infinite Binary Information Systems. Decision Trees of Types 4 and 5. In: Decision Trees with Hypotheses. Synthesis Lectures on Intelligent Technologies. Springer, Cham. https://doi.org/10.1007/978-3-031-08585-7_8

Download citation

Publish with us

Policies and ethics