Skip to main content

On Rough Sets with Structures and Properties

  • Conference paper

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

Abstract

The Rough Sets paradigm is extended to the sets that have some structure (for example they are relations) and some properties (for example they are transitive relations).

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Reading (1983)

    MATH  Google Scholar 

  2. Burris, S., Sankappanavar, H.P.: A Course in Universal Algebra. Springer, Heidelberg (1981)

    MATH  Google Scholar 

  3. Huth, M.R.A., Ryan, M.D.: Logic in Computer Science. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  4. Janicki, R.: Ranking with Partial Orders and Pairwise Comparisons. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 442–451. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  5. Janicki, R.: Some Remarks on Approximations of Arbitrary Binary Relations by Partial Orders. In: Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) RSCTC 2008. LNCS (LNAI), vol. 5306, pp. 81–91. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Janicki, R.: Approximations of Arbitrary Binary Relations by Partial Orders. Classical and Rough Set Models (submitted)

    Google Scholar 

  7. Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Reading (2006)

    Google Scholar 

  8. Kuratowski, K., Mostowski, A.: Set Theory, 2nd edn. North Holland, Amsterdam (1976)

    MATH  Google Scholar 

  9. Pawlak, Z.: Rought Sets. International Journal of Computer and Information Sciences 34, 557–590 (1982)

    MathSciNet  Google Scholar 

  10. Pawlak, Z.: Rough Sets. Kluwer, Dordrecht (1991)

    MATH  Google Scholar 

  11. Rosen, K.H.: Discrete Mathematics and Its Applications. McGraw-Hill, New York (1999)

    Google Scholar 

  12. Skowron, A., Stepaniuk, J.: Approximation of relations. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, pp. 161–166. Springer, London (1994)

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  14. Stewart, J.: Calculus. Concepts and Contexts. Brooks/Cole, Monterey (1997)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Yao, Y.Y., Wang, T.: On Rough Relations: An Alternative Formulations. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol. 1711, pp. 82–91. Springer, Heidelberg (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janicki, R. (2009). On Rough Sets with Structures and Properties. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. RSFDGrC 2009. Lecture Notes in Computer Science(), vol 5908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10646-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10646-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics