Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Soft Computing

RSFDGrC 2011: Rough Sets, Fuzzy Sets, Data Mining and Granular Computing pp 72–78Cite as

Covering Numbers in Covering-Based Rough Sets

  • Conference paper

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

Abstract

Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-based rough sets which are generalizations of rough sets. With covering numbers, we establish a distance structure, two semilattices and a lattice for covering-based rough sets. The new concepts are helpful in studying covering-based rough sets from topological and algebraical viewpoints.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Wang, G., Yu, H., Yang, D.: Decision table reduction based on conditional information entropy. Chinese Journal of Computers 2, 759–766 (2002)

    MathSciNet  Google Scholar 

  3. Qian, Y., Liang, J., Pedrycz, W., Dang, C.: Positive approximation: An accelerator for attribute reduction in rough set theory. Artificial Intelligence 174, 597–618 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Banerjee, M., Mitra, S., Pal, S.: Rough fuzzy mlp: knowledge encoding and classification. IEEE Transactions on Neural Networks 9, 1203–1216 (1998)

    Article  Google Scholar 

  5. Qian, Y., Liang, J., Yao, Y., Dang, C.: Mgrs: A multi-granulation rough set. Information Sciences 180, 949–970 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Min, F., Liu, Q.: A hierarchical model for test-cost-sensitive decision systems. Information Sciences 179, 2442–2452 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Zhu, W., Wang, F.: Reduction and axiomization of covering generalized rough sets. Information Sciences 152, 217–230 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhu, W.: Relationship between generalized rough sets based on binary relation and covering. Information Sciences 179, 210–225 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Zhu, W.: Generalized rough sets based on relations. Information Sciences 177, 4997–5011 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Zhu, W.: Relationship among basic concepts in covering-based rough sets. Information Sciences 17, 2478–2486 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Wang, S., Zhu, P., Zhu, W.: Structure of covering-based rough sets. International Journal of Mathematical and Computer Sciences 6, 147–150 (2010)

    Google Scholar 

  12. Zhu, W.: Topological approaches to covering rough sets. Information Sciences 177, 1499–1508 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Wang, S., Zhu, W., Zhu, P.: Poset approaches to covering-based rough sets. Rough Sets and Knowledge Technology, 25–29 (2010)

    Google Scholar 

  14. Liu, G., Zhu, W.: The algebraic structures of generalized rough set theory. Information Sciences 178, 4105–4113 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  15. Yao, Y.: Constructive and algebraic methods of theory of rough sets. Information Sciences 109, 21–47 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  16. Zhu, W., Wang, F.-Y.: Binary relation based rough sets. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds.) FSKD 2006. LNCS (LNAI), vol. 4223, pp. 276–285. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Wang, S., Zhu, W., Zhu, P.: Abstract interdependency in rough sets. Journal of Nanjing University 46, 507–510 (2010) (in chinese)

    MathSciNet  MATH  Google Scholar 

  18. Rajagopal, P., Masone, J.: Discrete mathematics for computer science. Saunders College, Canada (1992)

    Google Scholar 

  19. Min, F., Liu, Q., Fang, C.: Rough sets approach to symbolic value partition. International Jounal on Approximate Reasoning 49, 689–700 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, China

    Shiping Wang

  2. Lab of Granular Computing, Zhangzhou Normal University, Zhangzhou, 363000, China

    Fan Min & William Zhu

Authors
  1. Shiping Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fan Min
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. William Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. State University Higher School of Economics, Pokrovskiy Bd. 11, 109028, Moscow, Russia

    Sergei O. Kuznetsov

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

    Dominik Ślęzak

  3. Department of Computer Science, University of Regina, 3737 Wascana Parkway, S4S 0A2, Regina, SK, Canada

    Daryl H. Hepting

  4. Birbeck University of London, Malet Street, WC1E 7HX, London, UK

    Boris G. Mirkin

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, S., Min, F., Zhu, W. (2011). Covering Numbers in Covering-Based Rough Sets. In: Kuznetsov, S.O., Ślęzak, D., Hepting, D.H., Mirkin, B.G. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2011. Lecture Notes in Computer Science(), vol 6743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21881-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21881-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21880-4

  • Online ISBN: 978-3-642-21881-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation