Skip to main content
SpringerLink
Log in

Decision Rules for Decision 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

In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be ‘over-fitted’, so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length.

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. Cheriyan, J., Ravi, R.: Lecture notes on approximation algorithms for network problems (1998), http://www.math.uwaterloo.ca/jcheriya/lecnotes.html

  2. Feige, U.: A threshold of ln n for approximating set cover (Preliminary version). In: Proc. 28th Annual ACM Symposium on the Theory of Computing, pp. 314–318 (1996)

    Google Scholar 

  3. Moshkov, M., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. SCI, vol. 145. Springer, Heidelberg (2008)

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  5. Ślęzak, D.: Approximate entropy reducts. Fundam. Inform. 53, 365–390 (2002)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Igor Chikalov & Beata Zielosko

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

    Beata Zielosko

Authors
  1. Igor Chikalov
    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

Chikalov, I., Zielosko, B. (2011). Decision Rules for Decision 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_95

Download citation

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

  • 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