Skip to main content
SpringerLink
Log in

Rough Sets and Matroids

  • Chapter
Transactions on Rough Sets XVII

Part of the book series: Lecture Notes in Computer Science ((TRS,volume 8375))

Abstract

We prove the recent result of Liu and Zhu [1] and discuss some consequences of that and related facts for the development of rough set theory.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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.

Similar content being viewed by others

References

  1. Liu, Y., Zhu, W.: Parametric matroid of rough set. arXiv: 1209.4975, 1–15 (2012)

    Google Scholar 

  2. Tanga, J., Shea, K., Minb, F., Zhu, W.: A matroidal approach to rough set theory. Theoretical Computer Science 471, 1–11 (2013)

    Article  MathSciNet  Google Scholar 

  3. Pawlak, Z.: Rough sets. International Journal of Computer and Information Sciences 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. System Theory, Knowledge Engineering and Problem Solving, vol. 9. Kluwer Academic Publishers, Dordrecht (1991)

    Book  MATH  Google Scholar 

  5. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Information Sciences 177, 3–27 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Pawlak, Z., Skowron, A.: Rough sets: Some extensions. Information Sciences 177, 28–40 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Information Sciences 177, 41–73 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Edwards, J.: Matroids and the greedy algorithm. Mathematical Programming 1, 127–136 (1971)

    Article  MathSciNet  Google Scholar 

  9. Oxley, J.: Matroid Theory. Oxford University Press, Oxford (2006)

    MATH  Google Scholar 

  10. Pawlak, Z.: Rough logic. Bulletin of the Polish Academy of Sciences, Technical Sciences 35, 253–258 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, Lexington, KY, USA, 40506

    Victor W. Marek

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

    Andrzej Skowron

Authors
  1. Victor W. Marek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Skowron
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computational Intelligence Laboratory, ECE Department, University of Manitoba, MB R3T 5V6, Winnipeg, Canada

    James F. Peters

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

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Marek, V.W., Skowron, A. (2014). Rough Sets and Matroids. In: Peters, J.F., Skowron, A. (eds) Transactions on Rough Sets XVII. Lecture Notes in Computer Science, vol 8375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54756-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54756-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54755-3

  • Online ISBN: 978-3-642-54756-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation