Skip to main content

Infinite Binary Information Systems. Decision Trees of Types 1, 2, and 3

  • 71 Accesses

Part of the Synthesis Lectures on Intelligent Technologies book series (SLIT)

Abstract

In this chapter, based on results of test theory, rough set theory, and exact learning, 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 study decision trees of three types based on attributes from problem description: (1) using only attributes, (2) using only hypotheses, and (3) using both attributes and hypotheses. As time complexity, we use 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 type 1 grows either as a logarithm or linearly, and the minimum depth of decision trees of types 2 and 3 either is bounded from above by a constant or grows as a logarithm, or linearly. Based on these results, we divide the set of all infinite binary information systems into four complexity classes.

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   119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   159.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. Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319–342 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  2. Angluin, D.: Queries revisited. Theor. Comput. Sci. 313(2), 175–194 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Littlestone, N.: Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Mach. Learn. 2(4), 285–318 (1988)

    Article  Google Scholar 

  4. Maass, W., Turán, G.: Lower bound methods and separation results for on-line learning models. Mach. Learn. 9, 107–145 (1992)

    Article  MATH  Google Scholar 

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

    MATH  Google Scholar 

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

    Google Scholar 

  7. Moshkov, M.: On depth of conditional tests for tables from closed classes. In: Markov, A.A. (ed.) Combinatorial-Algebraic and Probabilistic Methods of Discrete Analysis, pp. 78–86. Gorky University Press, Gorky (1989). (in Russian)

    Google Scholar 

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

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

  10. Moshkov, M.: On the depth of decision trees with hypotheses. Entropy 24(1), 116 (2022). https://doi.org/10.3390/e24010116

  11. Naiman, D.Q., Wynn, H.P.: Independence number and the complexity of families of sets. Discrete Math. 154, 203–216 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  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 1, 2, and 3. In: Decision Trees with Hypotheses. Synthesis Lectures on Intelligent Technologies. Springer, Cham. https://doi.org/10.1007/978-3-031-08585-7_7

Download citation

Publish with us

Policies and ethics