Skip to main content
SpringerLink
Log in

On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2005))

Included in the following conference series:

Abstract

An algorithm is considered which for a given decision table constructs a decision tree with minimal number of nodes. The class of all information systems (finite and infinite) is described for which this algorithm has polynomial time complexity depending on the number of columns (attributes) in decision tables.

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chegis, I.A., Yablonskii, S.V.: Logical methods of electric circuit control. Trudy MIAN SSSR 51 (1958) 270–360 (in Russian)

    MATH  Google Scholar 

  2. Chikalov, I.V.: Algorithm for constructing of decision trees with minimal average depth. Proceedings of The 8th Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems 1. July 3-7, Madrid, Spain (2000) 376–379

    Google Scholar 

  3. Markov, Al.A.: Circuit complexity of discrete optimization. Diskretnaya Matematika 4(3) (1992) 29–46 (in Russian)

    Google Scholar 

  4. Morzhakov, N.M.: On relationship between complexity of a set description and complexity of problem of linear form minimization on this set. Kombinatornoalgebraicheskiye Metody v Prikladnoi Matematike. Gorky University Publishers, Gorky (1985) 83–98 (in Russian)

    Google Scholar 

  5. Morzhakov, N.M.: On complexity of discrete extremal problem solving in the class of circuit algorithms. Matematicheskie Voprosi Kybernetiki 6. Nauka, Moscow (1996) 215–238 (in Russian)

    MathSciNet  Google Scholar 

  6. Moshkov, M.Ju.: On problem of linear form minimization on finite set. Kombinatorno-algebraicheskiye Metody v Prikladnoi Matematike. Gorky University Publishers, Gorky (1985) 98–119 (in Russian)

    Google Scholar 

  7. Moshkov, M.Ju., Chkalov, I.V.: On efficient algorithms for conditional test constructing. Proceedings of the Twelfth International Conference “Problems of Theoretical Cybernetics” 2. Nizhni Novgorod, Russia (1999) 165 (in Russian)

    Google Scholar 

  8. Moshkov, M.Ju, Chikalov I.V.: On algorithm for constructing of decision trees with minimal depth. Fundamenta Informaticae 41(3) (2000) 295–299

    MATH  MathSciNet  Google Scholar 

  9. Pawlak, Z.: Rough Sets-Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht, Boston, London (1991)

    MATH  Google Scholar 

  10. Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory. Edited by R. Slowinski. Kluwer Academic Publishers, Dordrecht, Boston, London (1992) 331–362

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computing Mathematics and Cybernetics of Nizhni Novgorod State University, 23, Gagarina Av., Nizhni Novgorod, 603600, Russia

    Igor Chikalov

Authors
  1. Igor Chikalov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Regina Regina, S4S 0A2, Saskatchewan, Canada

    Wojciech Ziarko  & Yiyu Yao  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chikalov, I. (2001). On Algorithm for Constructing of Decision Trees with Minimal Number of Nodes. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-45554-X_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43074-2

  • Online ISBN: 978-3-540-45554-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation