Skip to main content
SpringerLink
Log in

Introduction

  • Chapter
  • First Online:
Comparative Analysis of Deterministic and Nondeterministic Decision Trees

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

  • 334 Accesses

Abstract

In this chapter, we begin with the consideration of results obtained in the frameworks of the three main directions of the study, describe the contents of the book, and finally add some words about its use.

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

Access this chapter

Log in via an institution
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. AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M.: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. Intelligent Systems Reference Library, vol. 146. Springer, Cham (2019)

    Google Scholar 

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

  3. Blockeel, H., Schietgat, L., Struyf, J., Dzeroski, S., Clare, A.: Decision trees for hierarchical multilabel classification: A case study in functional genomics. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) Knowledge Discovery in Databases: 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2006, Berlin, Germany, September 18–22, 2006, Lecture Notes in Computer Science, vol. 4213, pp. 18–29. Springer, Berlin (2006)

    Google Scholar 

  4. Blum, M., Impagliazzo, R.: Generic oracles and oracle classes (extended abstract). In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, October 27–29, 1987, pp. 118–126. IEEE Computer Society (1987)

    Google Scholar 

  5. Boros, E., Hammer, P.L., Ibaraki, T., Kogan, A.: Logical analysis of numerical data. Math. Program. 79, 163–190 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Boros, E., Hammer, P.L., Ibaraki, T., Kogan, A., Mayoraz, E., Muchnik, I.: An implementation of logical analysis of data. IEEE Trans. Knowl. Data Eng. 12, 292–306 (2000)

    Article  Google Scholar 

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

    MATH  Google Scholar 

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

  9. Chegis, I.A., Yablonskii, S.V.: Logical methods of control of work of electric schemes. Trudy Mat. Inst. Steklov (in Russian) 51, 270–360 (1958)

    MathSciNet  Google Scholar 

  10. Crama, Y., Hammer, P.L., Ibaraki, T.: Cause-effect relationships and partially defined Boolean functions. Ann. Oper. Res. 16, 299–326 (1988)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Moshkov, M.: Comparative analysis of complexity of deterministic and nondeterministic decision trees. Local approach. In: Actual Problems of Modern Mathematics 1 (in Russian), pp. 109–113. NII MIOO NGU Publishers, Novosibirsk (1995)

    Google Scholar 

  14. Moshkov, M.: Two approaches to investigation of deterministic and nondeterministic decision trees complexity. In: Glas, M.D., Pawlak Z. (eds.) Second World Conference on the Fundamentals of Artificial Intelligence, WOCFAI 1995, Paris, France, 3–7 July 1995, pp. 275–280 (1995)

    Google Scholar 

  15. Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision tree complexity. Global approach. Fundam. Inform. 25(2), 201–214 (1996)

    Article  MathSciNet  Google Scholar 

  16. Moshkov, M.: Local and global approaches to comparative analysis of complexity of deterministic and nondeterministic decision trees. In: Actual Problems of Modern Mathematics 2 (in Russian), pp. 110–118. NII MIOO NGU Publishers, Novosibirsk (1996)

    Google Scholar 

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

  18. Moshkov, M.: Unimprovable upper bounds on time complexity of decision trees. Fundam. Inform. 31(2), 157–184 (1997)

    Article  MathSciNet  Google Scholar 

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

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

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

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

    Google Scholar 

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

    Article  Google Scholar 

  24. Pawlak, Z.: Rough Sets - Theoretical Aspect of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  25. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3–27 (2007)

    Article  MathSciNet  Google Scholar 

  26. Read, J., Martino, L., Olmos, P.M., Luengo, D.: Scalable multi-output label prediction: from classifier chains to classifier trellises. Pattern Recognit. 48(6), 2096–2109 (2015)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  28. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Słowiński, R. (ed.) Intelligent Decision Support: Handbook of Applications and Advances of the Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)

    Chapter  Google Scholar 

  29. Soloviev, N.A.: Tests (Theory, Construction, Applications). Nauka, Novosibirsk (1978). (in Russian)

    Google Scholar 

  30. Wieczorkowska, A., Synak, P., Lewis, R.A., Ras, Z.W.: Extracting emotions from music data. In: Hacid, M., Murray, N.V., Ras, Z.W., Tsumoto, S. (eds.) Foundations of Intelligent Systems, 15th International Symposium, ISMIS 2005, Saratoga Springs, NY, USA, May 25–28, 2005. Lecture Notes in Computer Science, vol. 3488, pp. 456–465. Springer, Berlin (2005)

    Google Scholar 

  31. Zhou, Z.H., Jiang, K., Li, M.: Multi-instance learning based web mining. Appl. Intell. 22(2), 135–147 (2005)

    Article  Google Scholar 

  32. Zhuravlev, J.I.: On a class of partial Boolean functions. Diskret. Analiz (in Russian) 2, 23–27 (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer, Electrical and Mathematical Science and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

    Mikhail Moshkov

Authors
  1. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

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). Introduction. 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_1

Download citation

Publish with us

Policies and ethics

Search

Navigation