Skip to main content
SpringerLink
Log in

Restricted Linear Information Systems

  • Conference paper
Intelligent Information Processing and Web Mining

Part of the book series: Advances in Soft Computing ((AINSC,volume 31))

Abstract

In the paper a class of infinite information systems is described. For decision tables over each such information system there exist low upper bounds on minimal complexity of decision trees and polynomial algorithms of decision tree optimization for various complexity measures.

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 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. Chikalov, I.V. (1998) Bounds on average weighted depth of decision trees depending only on entropy. Proceedings of the Seventh International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, Vol. 2. Paris, France, 1190–1194

    Google Scholar 

  2. Chikalov, I.V. (2000) Algorithm for constructing of decision trees with minimal average depth. Proceedings of the Eighth International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, Vol. 1. Madrid, Spain, 376–379

    Google Scholar 

  3. Chikalov, I.V. (2000) Algorithm for constructing of decision trees with minimal number of nodes. Proceedings of the Second International Conference on Rough Sets and Current Trends in Computing. Banff, Canada 107–111

    Google Scholar 

  4. Chlebus, B.S., Nguyen, S.H. (1998) On finding optimal discretization for two attributes. Proceedings of the First International Conference on Rough Sets and Current Trends in Computing. Warsaw, Poland. Lecture Notes in Artificial Intelligence 1424, Springer-Verlag, 537–544

    Google Scholar 

  5. Danzer, L., Grunbaum, B., Klee, V. (1963) Helly’s theorem and its relatives. Proceedings of Symposia in Pure Mathematics, Vol. 7. American Mathematical Society, Providence, Rhode Island, 101–180

    Google Scholar 

  6. Hall, M. (1967) Combinatorial Theory. Blaisdell Publishing Company, Waltham (Massachusetts)

    Google Scholar 

  7. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A. (1999) Rough sets. A tutorial. Rough-Fuzzy Hybridization: A New Trend in Decision-Making. Edited by S.K. Pal and A. Skowron, Springer-Verlag, Singapore, 3–98

    Google Scholar 

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

    Google Scholar 

  9. Moshkov, M.Ju., Chikalov, I.V. (1997) Bounds on average depth of decision trees. Proceedings of the Fifth European Congress on Intelligent Techniques and Soft Computing. Aachen, Germany 226–230

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, 39, Będzińska St., Sosnowiec, 41-200, Poland

    Mikhail Ju. Moshkov

Authors
  1. Mikhail Ju. Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Sciences, Polish Academy of Sciences, ul. Ordona 21, 01-237, Warszawa, Poland

    Mieczysław A. Kłopotek , Sławomir T. Wierzchoń  & Krzysztof Trojanowski ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moshkov, M.J. (2005). Restricted Linear Information Systems. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32392-9_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-32392-9_67

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32392-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation