Skip to main content
SpringerLink
Log in

Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts

  • 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

We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relationships between rough set reducts and boolean prime implicants.

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. Brown, E.M.: Boolean Reasoning. Kluwer Academic Publishers, Dordrecht (1990).

    MATH  Google Scholar 

  2. Pawlak, Z.: Rough sets Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht (1991).

    MATH  Google Scholar 

  3. Pawlak, Z.: Decision rules, Bayes' rule and rough sets. In: N. Zhong, A. Skowron and S. Ohsuga (eds.), Proc. of the Seventh International WorkshopRSFDGrC'99, Yamaguchi, Japan, LNAI 1711 (1999) pp. 1–9.

    Google Scholar 

  4. Pawlak, Z., Skowron, A.: Rough membershipfunctions. In: R.R. Yaeger, M. Fedrizzi, and J. Kacprzyk (eds.), Advances in the Dempster Shafer Theory of Evidence, John Wiley & Sons, Inc., New York, Chichester, Brisbane, Toronto, Singapore (1994) pp. 251–271.

    Google Scholar 

  5. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988).

    Google Scholar 

  6. Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery, parts 1, 2, Heidelberg, Physica-Verlag (1998) pp. 321–365.

    Google Scholar 

  7. Skowron, A.: Boolean reasoning for decision rules generation. In: Proc. of the Seventh International Symposium ISMIS'93, Trondheim, Norway, 1993; J. Komorowski, Z. Ras (eds.), LNAI 689, Springer-Verlag (1993) pp. 295–305.

    Google Scholar 

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

    Google Scholar 

  9. Ślec,zak, D.: Various approaches to reasoning with frequency-based decision reducts: a survey. In: L. Polkowski, S. Tsumoto, T.Y. Lin (eds.), Rough Sets in Soft Computing and Knowledge Discovery: New Developments, Physica-Verlag / Springer-Verlag (2000).

    Google Scholar 

  10. Ziarko, W.: Decision Making with Probabilistic Decision Tables. In: N. Zhong, A. Skowron and S. Ohsuga (eds.), Proc. of the Seventh International Workshop RSFDGrC'99, Yamaguchi, Japan, LNAI 1711 (1999) pp. 463–471.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Maciej Borkowski

  2. Polish-Japanese Institute of Information Technology, Koszykowa 86, 02-008, Warsaw, Poland

    Dominik Ślęzak & Dominik Ślęzak

Authors
  1. Maciej Borkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominik Ślęzak
    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

Borkowski, M., Ślęzak, D. (2001). Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts. 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_14

Download citation

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

  • 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