Skip to main content

From Vagueness to Rough Sets in Partial Approximation Spaces

  • Conference paper
Rough Sets and Intelligent Systems Paradigms

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

Abstract

Vagueness has a central role in the motivation basis of rough set theory. Expressing vagueness, after Frege, Pawlak’s information-based proposal was the boundary regions of sets. In rough set theory, Pawlak represented boundaries by the differences of upper and lower approximations and defined exactness and roughness of sets via these differences. However, defining exactness/roughness of sets have some possibilities in general. In this paper, categories of vagueness, i.e., different kinds of rough sets, are identified in partial approximation spaces. Their formal definitions and intuitive meanings are given under sensible restrictions.

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. Banerjee, M., Chakraborty, M.: Algebras from rough sets. In: Pal, S., Polkowski, L., Skowron, A. (eds.) Rough-Neuro Computing: Techniques for Computing with Words, pp. 157–184. Springer, Berlin (2004)

    Chapter  Google Scholar 

  2. Ciucci, D.: Approximation algebra and framework. Fundamenta Informaticae 94, 147–161 (2009)

    MathSciNet  MATH  Google Scholar 

  3. Csajbók, Z., Mihálydeák, T.: Partial approximative set theory: A generalization of the rough set theory. International Journal of Computer Information Systems and Industrial Management Applications 4, 437–444 (2012)

    MATH  Google Scholar 

  4. Csajbók, Z., Mihálydeák, T.: A general set theoretic approximation framework. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds.) IPMU 2012, Part I. CCIS, vol. 297, pp. 604–612. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Csajbók, Z.E.: Approximation of sets based on partial covering. In: Peters, J.F., Skowron, A., Ramanna, S., Suraj, Z., Wang, X. (eds.) Transactions on Rough Sets XVI. LNCS, vol. 7736, pp. 144–220. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  6. Csajbók, Z.E., Mihálydeák, T.: Fuzziness in partial approximation framework. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, Kraków, Poland (FedCSIS 2013), September 8-11. Annals of Computer Science and Information Systems, Polish Information Processing Society, vol. 1, pp. 35–41. Polskie Towarzystwo Informatyczne (PTI), IEEE Computer Society Press, Warsaw, Poland (2013)

    Google Scholar 

  7. Järvinen, J.: Lattice theory for rough sets. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J.W., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 400–498. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Komorowski, J., Pawlak, Z., Polkowski, L., Skowron, A.: Rough sets: A tutorial. In: Pal, S., Skowron, A. (eds.) Rough Fuzzy Hybridization. A New Trend in Decision-Making, pp. 3–98. Springer, Singapore (1999)

    Google Scholar 

  9. Pagliani, P.: A pure logic-algebraic analysis of rough top and rough bottom equalities. In: Ziarko, W. (ed.) Rough Sets, Fuzzy Sets and Knowledge Discovery, Proceedings of the International Workshop on Rough Sets and Knowledge Discovery (RSKD 1993), Banff, Alberta, Canada, October 12-15. Workshops in Computing, pp. 225–236. Springer (1993)

    Google Scholar 

  10. Pagliani, P., Chakraborty, M.: A Geometry of Approximation: Rough Set Theory Logic, Algebra and Topology of Conceptual Patterns (Trends in Logic). Springer Publishing Company, Incorporated (2008)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    Book  Google Scholar 

  13. Yao, Y.Y.: Granular computing using neighborhood systems. In: Roy, R., Furuhashi, T., Chawdhry, P.K. (eds.) Advances in Soft Computing: Engineering Design and Manufacturing. The 3rd On-line World Conference on Soft Computing (WSC3), pp. 539–553. Springer, London (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Csajbók, Z.E., Mihálydeák, T. (2014). From Vagueness to Rough Sets in Partial Approximation Spaces. In: Kryszkiewicz, M., Cornelis, C., Ciucci, D., Medina-Moreno, J., Motoda, H., Raś, Z.W. (eds) Rough Sets and Intelligent Systems Paradigms. Lecture Notes in Computer Science(), vol 8537. Springer, Cham. https://doi.org/10.1007/978-3-319-08729-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08729-0_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08728-3

  • Online ISBN: 978-3-319-08729-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics