Skip to main content

An Equivalent Definition of Rough Sets

  • Conference paper
Book cover Rough Sets and Current Trends in Computing (RSCTC 2008)

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

Included in the following conference series:

Abstract

Using characteristic function of sets, this paper proposes the concept of linear mappings for the power sets of universal sets. Through this concept, we explain rough set upper approximation as a linear mapping and study the linear properties of rough sets. The relationship between the linear mappings and the upper approximations is established. The results and methods given in this paper will hopefully simplify the theoretical and practical researches of rough sets.

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 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. Grassmann, W.K., Tremblay, J.P.: Logical and discrete mathematics, A computer science perspective. Prentice-Hall, Inc., Englewood Cliffs (1996)

    Google Scholar 

  2. Kondo, M.: Algebraic approach to generalized rough sets. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 132–140. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Kondo, M.: On the structure of generalized rough sets. Information Sciences 176, 589–600 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Liu, G.L.: Rough sets over the Boolean algebras. In: Ślęzak, D., Wang, G., Szczuka, M.S., Düntsch, I., Yao, Y. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3641, pp. 124–131. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Liu, G.L.: The axiomatization of the rough set upper approximation operations. Fundamenta Informaticae 69, 331–342 (2006)

    MathSciNet  MATH  Google Scholar 

  6. Liu, G.L.: Generalized rough sets over fuzzy lattices. Information Sciences 178, 1651–1662 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Liu, G.L.: Axiomatic Systems for Rough Sets and Fuzzy Rough Sets. International Journal of Approximate Reasoning 48, 857–867 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Pawlak, Z.: Rough sets: Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Boston (1991)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Pei, D., Xu, Z.: Transformation of rough set models. Knowledge-Based Systems 20, 745–751 (2007)

    Article  Google Scholar 

  14. Qi, G., Liu, W.: Rough operations on Boolean algebras. Information Sciences 173, 49–63 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Radzikowska, A.M., Kerre, E.E.: Fuzzy rough sets based on residuated lattices. In: Peters, J.F., Skowron, A., Dubois, D., Grzymała-Busse, J.W., Inuiguchi, M., Polkowski, L. (eds.) Transactions on Rough Sets II. LNCS, vol. 3135, pp. 278–296. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  17. Slowinski, R., Vanderpooten, D.: A Generalized Definition of Rough Approximations Based on Similarity. IEEE Trans. On Knowledge and Data Engineering 12(2), 331–336 (1990)

    Article  Google Scholar 

  18. Yao, Y.Y.: Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning 15, 291–317 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  19. Yao, Y.Y.: Relational interpretations of neighborhood operators and rough set approximation operators. Information Sciences 111(1–4), 239–259 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  21. Yao, Y.Y., Lin, T.Y.: Generalization of rough sets using modal logic. Intelligent Automation and Soft Computing, An International Journal 2, 103–120 (1996)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, G., Huang, J.K. (2008). An Equivalent Definition of Rough Sets. In: Chan, CC., Grzymala-Busse, J.W., Ziarko, W.P. (eds) Rough Sets and Current Trends in Computing. RSCTC 2008. Lecture Notes in Computer Science(), vol 5306. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88425-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88425-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88423-1

  • Online ISBN: 978-3-540-88425-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics