Skip to main content

Two Pairs of Operators in Degree Induced Covering Rough Set

  • Conference paper
Applied Informatics and Communication (ICAIC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 227))

Included in the following conference series:

  • 1571 Accesses

Abstract

Two pairs of operators are defined in degree induced covering rough set and their properties are discussed. Using them, two pairs of inequalities well known in the degree induced covering rough set theory can now be modified to become equalities respectively.

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

Access this chapter

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. Pawlak, Z.: Rough sets. International Journal of Computer and Information Science 11, 341–356 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pawlak, Z.: Rough sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Boston (1991)

    Book  MATH  Google Scholar 

  3. Cattaneo, G.: Abstract approximation spaces for rough theorie. In: Rough Sets in Knowledge Discovery 1: Methodology and Applications, pp. 59–98 (1998)

    Google Scholar 

  4. Skowron, J.S.A.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)

    MathSciNet  MATH  Google Scholar 

  5. Slowinski, D.V.R.: A generalized definition of rough approximations based on similarity. IEEE Trans. On Knowledge and Data Engineering 12(2), 331–336 (2000)

    Article  MathSciNet  Google Scholar 

  6. Zakowski, W.: Approximations in the space (u,π). Demonstratio Mathematica 16, 761–769 (1983)

    MathSciNet  MATH  Google Scholar 

  7. Bonikowski, Z., Bryniarski, E., Wybraniec, U.: Extensions and intentions in therough set theory. Information Sciences 107, 149–167 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Zhu, G., Huo, Y.: The concept and property of induced covering rough set. China new technologies and products 12, 237 (2010)

    Google Scholar 

  9. Zhang, H., Liang, H.: Boolean Algebra Based on the Two New operations in the Rough Set Theory. Journal of applied sciences 22(4), 503–508 (2004)

    Google Scholar 

  10. Zhang, H., Liang, H., Liu, D.: Two new operators in rough set theory with applications to fuzzy sets. Information Sciences 166, 147–165 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Yang, Y., Wu, P., Li, L.: A note on two new operators in rough set theory. Journal of Northwest Normal University 43(4), 17–19 (2007)

    MATH  Google Scholar 

  12. Zhang, X., Xie, S., Mo, Z.: Graded rough sets. Journal of Sichuan normal university 33(1), 12–16 (2010)

    Google Scholar 

  13. Zhu, W., Wang, F.-y.: Relations among Three Types of Covering Rough Sets. In: IEEE GrC 2006, Atlanta, GA, USA, May 10-12, pp. 43–48 (2006)

    Google Scholar 

  14. Chen, D., Li, L., Wu, K.: Degree induced covering rough set model. In: ETT 2010 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tao, Z., Dingjun, C., Li, Z., Mao, X. (2011). Two Pairs of Operators in Degree Induced Covering Rough Set. In: Zhang, J. (eds) Applied Informatics and Communication. ICAIC 2011. Communications in Computer and Information Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23226-8_63

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23226-8_63

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23225-1

  • Online ISBN: 978-3-642-23226-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics