Skip to main content
SpringerLink
Log in

Boolean Covering Approximation Space and Its Reduction

  • Conference paper
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2013)

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

  • 1184 Accesses

Abstract

In this paper, Boolean vector algebra theory is introduced into rough set theory. A theoretical framework of Boolean covering approximation space is proposed, and based on the principle of traditional covering rough set theory, a pair of lower and upper approximation operators on a Boolean covering approximation space are defined. Properties of the lower and upper approximation operators are investigated in detail. The duality of the lower and upper approximation operators, and lower and upper definable Boolean vectors are discussed. Finally, reductions of lower and upper approximation operators are explored.

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. Bonikowski, Z., Brynirski, E., Wybraniec, U.: Extensions and intentions in the rough set theory. Information Sciences 107, 149–167 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chen, D., Wang, C., Hu, Q.: A new approach to attributes reduction of consistent and inconsistent covering decision systems with covering rough sets. Information Sciences 177, 3500–3518 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hu, Q.H., Pedrgcz, W., Yu, D.R., Lang, J.: Selecting discrete and continuous feasures based on neighborhood decision error minimization. IEEE Transactions on Systems, Man and Cybernetics-Part B: Cybernetics 40, 137–150 (2010)

    Article  Google Scholar 

  4. Kim, K.H.: Boolean Matrix Theory and Applications. Marcel Dekber Inc. (1982)

    Google Scholar 

  5. Li, T.J., Leung, Y., Zhang, W.X.: Generalized fuzzy rough approximation operators based on fuzzy coverings. International Journal of Approximation Reasoning 48, 836–856 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Liu, G.: Rough set theory based on two universal sets and its applications. Knowledge-Based Systems 23, 110–115 (2010)

    Article  Google Scholar 

  7. Liu, G., Sai, Y.: Invertible approximation operators of generalized rough sets and fuzzy rough sets. Information Sciences 180, 2221–2229 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lin, G., Liang, J., Qian, Y.: Multigranulation rough sets: From partition to covering. Information Sciences 241, 101–118 (2013)

    Article  MathSciNet  Google Scholar 

  9. Skowron, A., Stepaniuk, J., Swiniarski, R.: Modeling rough granular computing based on approximation spaces. Information Sciences 184(1), 20–43 (2012)

    Article  Google Scholar 

  10. Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Transactions on Knowledge and Data Engineering 12, 331–336 (2000)

    Article  Google Scholar 

  11. Tsang, E.C.C., Chen, D., Yeung, D.S.: Approximations and reducts with covering generalized rough sets. Computers and Mathematics with Applications 56, 279–289 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Qian, Y.H., Liang, J.Y., Dang, C.Y.: Converse approximation and rule extraction from decision tables in rough set theory. Comput. Math. Appl. 55(8), 1754–1765 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Wang, L., Yang, X., Yang, J., Wu, C.: Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system. Information Sciences 207, 66–78 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  15. Yao, Y.Y.: Probabilistic rough set approximations. International Journal of Approximate Reasoning 49, 255–271 (2008)

    Article  MATH  Google Scholar 

  16. Yao, Y.Y.: The superiority of three-way decisions in probabilistic rough set models. Information Sciences 181, 1080–1096 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  17. Yao, Y., Yao, B.: Covering based rough set approximations. Information Sciences 200, 91–107 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  18. Yang, T., Li, Q.: Reduction about approximation spaces of covering generalized rough sets. International Journal of Approximate Reasoning 51, 335–345 (2010)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhu, W., Wang, F.Y.: The fourth type of covering-based rough sets. Information Sciences 201, 80–92 (2012)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics, Physics and Information Science, Zhejiang Ocean University, Zhoushan, Zhejiang, 316000, P.R. China

    Tong-Jun Li & Wei-Zhi Wu

Authors
  1. Tong-Jun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wei-Zhi Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Milano-Bicocca, viale Sarca 336/14, 20126, Milano, Italy

    Davide Ciucci

  2. Osaka University, 560-8531, Toyonaka, Osaka, Japan

    Masahiro Inuiguchi

  3. University of Regina, S4S 0A2, Regina, SK, Canada

    Yiyu Yao

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

    Dominik Ślęzak

  5. Chongqing Institute of Green and Intelligent Technology, CAS, 401122, Chongqing, China

    Guoyin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, TJ., Wu, WZ. (2013). Boolean Covering Approximation Space and Its Reduction. In: Ciucci, D., Inuiguchi, M., Yao, Y., Ślęzak, D., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2013. Lecture Notes in Computer Science(), vol 8170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41218-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41218-9_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41217-2

  • Online ISBN: 978-3-642-41218-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation