Skip to main content
SpringerLink
Log in
Book cover

International Joint Conference on Rough Sets

IJCRS 2017: Rough Sets pp 49–57Cite as

The Multi-purpose Role of the Relational Approach to Classic and Generalized Approximation Spaces. A Tutorial

  • Conference paper
  • First Online:

  • 1063 Accesses

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

Abstract

Rough Set Theory is inherently connected with relations.

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

Notes

  1. 1.

    If the cylindrification of X is given by \(X\times M\), then [i](X) is a right cylinder subset of \(M\times M\). If the cylindrification of X is \(X\times G\), then [i](X) is a right cylinder subset of \(M\times G\). Similar considerations apply to [e](X).

  2. 2.

    Our argument proves that the dual of \(\underline{C_1}(X)\) is not the operator \(X^*\) introduced in [1], in an elementary but analytic way without using counterexamples.

References

  1. Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U.: Extensions and intensions in the rough set theory. Inf. Sci. 107, 149–167 (1998)

    Article  Google Scholar 

  2. Comer, S.: On connections between information systems, rough sets and algebraic logic. In: Algebraic Methods in Logic and Computer Science, vol. 28. Banach Center Publications (1993)

    Google Scholar 

  3. Düntsch, I.: Rough sets and algebras. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 95–108. Physica-Verlag, Heidelberg (1997)

    Google Scholar 

  4. Düntsch, I., Gegida, G.: Modal-style operators in qualitative data analysis. In: Proceedings of the 2002 IEEE International Conference on Data Mining, pp. 155–162 (2002)

    Google Scholar 

  5. Huang, A., Zhu, W.: Topological characterizations for three covering approximation operators. In: Ciucci, D., Inuiguchi, M., Yao, Y., Ślęzak, D., Wang, G. (eds.) RSFDGrC 2013. LNCS, vol. 8170, pp. 277–284. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41218-9_30

    Chapter  Google Scholar 

  6. Pagliani, P.: A modal relation algebra for generalized approximation spaces. In Tsumoto S., Kobayashi S., Yokomori T., Tanaka H., Nakamura A. (eds.) Proceedings of the Fourth Int. Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, 6–8 November 1996. The University of Tokyo (1996)

    Google Scholar 

  7. Pagliani, P.: A practical introduction to the modal relational approach to Approximation Spaces. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 209–232. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

  8. Pagliani, P.: Covering rough sets and formal topology – a uniform approach through intensional and extensional constructors. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets XX. LNCS, vol. 10020, pp. 109–145. Springer, Heidelberg (2016). doi:10.1007/978-3-662-53611-7_4

    Chapter  MATH  Google Scholar 

  9. Pagliani, P., Chakraborty, M.K.: Information quanta and approximation spaces. I: non-classical approximation operators. In: Proceedings of the IEEE International Conference on Granular Computing, Beijing, China, 25–27, vol. 2, July 2005, pp. 605–610. IEEE Los Alamitos (2005)

    Google Scholar 

  10. Pagliani, P., Chakraborty, M.K.: A geometry of Approximation. Trends in Logic, vol. 27. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  11. Qin, K., Gao, Y., Pei, Z.: On covering rough sets. In: Yao, J.T., Lingras, P., Wu, W.-Z., Szczuka, M., Cercone, N.J., Ślęzak, D. (eds.) RSKT 2007. LNCS, vol. 4481, pp. 34–41. Springer, Heidelberg (2007). doi:10.1007/978-3-540-72458-2_4

    Chapter  Google Scholar 

  12. Sambin, G., Gebellato, S.: A preview of the basic picture: a new perspective on formal topology. In: Altenkirch, T., Reus, B., Naraschewski, W. (eds.) TYPES 1998. LNCS, vol. 1657, pp. 194–208. Springer, Heidelberg (1999). doi:10.1007/3-540-48167-2_14

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  14. Yao, Y.Y., Chen, Y.H.: Rough set approximations in formal concept analysis. In: Proceedings of 2004 Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS 2004), pp. 73–78. IEEE Catalog Number: 04TH8736 (2004)

    Google Scholar 

  15. Zakowski, W.: Approximations in the space \((U,\Pi )\). Demonstratio Mathematic 16, 761–769 (1983)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Group on Knowledge Models, Roma, Italy

    Piero Pagliani

Authors
  1. Piero Pagliani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piero Pagliani .

Editor information

Editors and Affiliations

  1. Polish-Japanese Academy of Information Technology, Warsaw, Poland

    Lech Polkowski

  2. University of Regina, Regina, SK, Canada

    Yiyu Yao

  3. University of Warmia and Mazury, Olsztyn, Poland

    Piotr Artiemjew

  4. University of Milano-Bicocca, Milano, Italy

    Davide Ciucci

  5. Southwest Jiaotong University, Chengdu, China

    Dun Liu

  6. Warsaw University, Warszawa, Poland

    Dominik Ślęzak

  7. Silesian University, Sosnowiec, Poland

    Beata Zielosko

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Pagliani, P. (2017). The Multi-purpose Role of the Relational Approach to Classic and Generalized Approximation Spaces. A Tutorial. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10313. Springer, Cham. https://doi.org/10.1007/978-3-319-60837-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60837-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60836-5

  • Online ISBN: 978-3-319-60837-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation