Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2010)

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

Included in the following conference series:

  • 1475 Accesses

Abstract

In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case.

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. Moshkov, M., Piliszczuk, M., Zielosko, B.: Universal attribute reduction problem. In: Kryszkiewicz, M., Peters, J.F., Rybiński, H., Skowron, A. (eds.) RSEISP 2007. LNCS (LNAI), vol. 4585, pp. 417–426. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Moshkov, M., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. Springer book series Studies in Computational Intelligence, vol. 145. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  3. Nguyen, H.S., Ślȩzak, D.: Approximate reducts and association rules – correspondence and complexity results. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 137–145. Springer, Heidelberg (1999)

    Google Scholar 

  4. Pawlak, Z.: Rough sets. International J. Comp. Inform. Science 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

  7. Skowron, A.: Rough sets in KDD. In: Proceedings of the 16th World Computer Congress (IFIP 2000), Beijing, China, pp. 1–14 (2000)

    Google Scholar 

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

  9. Ślȩzak, D.: Approximate entropy reducts. Fundamenta Informaticae 53, 365–390 (2002)

    MathSciNet  Google Scholar 

  10. Ślȩzak, D., Wróblewski, J.: Order-based genetic algorithms for the search of approximate entropy reducts. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 308–311. Springer, Heidelberg (2003)

    Google Scholar 

  11. Wróblewski, J.: Ensembles of classifiers based on approximate reducts. Fundamenta Informaticae 47, 351–360 (2001)

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

    Igor Chikalov & Mikhail Moshkov

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

    Beata Zielosko

Authors
  1. Igor Chikalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikhail Moshkov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beata Zielosko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Marcin Szczuka

  2. ICS, Warsaw University of Technology,,  

    Marzena Kryszkiewicz

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

    Sheela Ramanna

  4. Dept. of Computer Science, The University of Wales, Aberystwyth, UK

    Richard Jensen

  5. Harbin Institute of Technology, PO Box 458, 150006, Harbin, China

    Qinghua Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chikalov, I., Moshkov, M., Zielosko, B. (2010). Upper Bounds on Minimum Cardinality of Exact and Approximate Reducts. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science(), vol 6086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13529-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13529-3_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13528-6

  • Online ISBN: 978-3-642-13529-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation