Skip to main content
SpringerLink
Log in

Construction of α-Decision Trees for Tables with Many-Valued Decisions

  • Conference paper
Rough Sets and Knowledge Technology (RSKT 2011)

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

Included in the following conference series:

Abstract

The paper is devoted to the study of greedy algorithm for construction of approximate decision trees (α-decision trees). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given row, we should find a decision from the set attached to this row. We consider bound on the number of algorithm steps, and bound on the algorithm accuracy relative to the depth of decision trees.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Moshkov, M.: Greedy algorithm for decision tree construction in context of knowledge discovery problems. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 192–197. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Pawlak, Z.: Rough Sets – Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  3. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177(1), 3–27 (2007); Rough sets: Some extensions. Information Sciences 177(1), 28–40 (2007); Rough sets and boolean reasoning. Information Sciences 177(1), 41–73 (2007)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal, 23955-6900, Saudi Arabia

    Mikhail Moshkov & Beata Zielosko

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

    Beata Zielosko

Authors
  1. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

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

    JingTao Yao

  2. Department of Applied Computer Science, University of Winnipeg, R3B 2E9, Winnipeg, Canada

    Sheela Ramanna

  3. Institute of Computer Science & Technology, Chongqing University of Posts and Telecommunications, 400065, Chongqing, P.R. China

    Guoyin Wang

  4. Chair of Computer Science, University of Rzeszów, Poland

    Zbigniew Suraj

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moshkov, M., Zielosko, B. (2011). Construction of α-Decision Trees for Tables with Many-Valued Decisions. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds) Rough Sets and Knowledge Technology. RSKT 2011. Lecture Notes in Computer Science(), vol 6954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24425-4_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24425-4_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24424-7

  • Online ISBN: 978-3-642-24425-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation