Skip to main content
SpringerLink
Log in

A Topological Approximation Space Based on Open Sets of Topology Generated by Coverings

  • Conference paper
  • First Online:
Rough Sets (IJCRS 2017)

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

Included in the following conference series:

  • 1026 Accesses

Abstract

In this paper we consider information granules based on coverings. We also present a topological approximation space, where lower and upper approximations are open sets. We show a way of forming neighbourhoods for ‘new’ (testing) objects. A topological rough fuzzy membership function is defined and then generalized to an extended rough fuzzy membership function of the ‘new’ objects. Basing on this extended membership function and the least neighbourhood of any ‘new’ object, we propose a new topological approach to classification problem.

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

Access this chapter

Log in via an institution
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 EPUB and 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

References

  1. Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3–27 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Pawlak, Z., Skowron, A.: Rough sets and boolean reasoning. Inf. Sci. 177(1), 41–73 (2007)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  4. Pomykala, J.A.: About tolerance and similarity relations in information systems. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS, vol. 2475, pp. 175–182. Springer, Heidelberg (2002). doi:10.1007/3-540-45813-1_22

    Chapter  Google Scholar 

  5. Pawlak, Z., Skowron, A.: Rough sets: some extensions. Inf. Sci. 177(1), 28–40 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Orłowska, E. (ed.): Incomplete Information: Rough Set Analysis. Physcia-Verlag, Heidelberg (1997)

    MATH  Google Scholar 

  7. Kryszkiewicz, M., Rybiński, H.: Data mining in incomplete information systems from rough set perspective. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications. New Developments in Knowledge Discovery in Information Systems. Physica Verlag, pp. 567–580. Physica Verlag, Heidelberg (2000)

    Google Scholar 

  8. Grzymala-Busse, J.W., Hu, M.: A comparison of several approaches to missing attribute values in data mining. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS, vol. 2005, pp. 378–385. Springer, Heidelberg (2001). doi:10.1007/3-540-45554-X_46

    Chapter  Google Scholar 

  9. Grzymala-Busse, J.W.: Data with missing attribute values: generalization of indiscernibility relation and rule induction. In: Peters, J.F., Skowron, A., Grzymała-Busse, J.W., Kostek, B., Świniarski, R.W., Szczuka, M.S. (eds.) Transactions on Rough Sets I. LNCS, vol. 3100, pp. 78–95. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27794-1_3

    Chapter  Google Scholar 

  10. Medhat, T.: Missing values via covering rough sets. Int. J. Data Min. Intell. Inf. Technol. Appl. 2(1), 10–17 (2012)

    Google Scholar 

  11. Li, T.-J.: Rough approximation operators in covering approximation spaces. In: Greco, S., Hata, Y., Hirano, S., Inuiguchi, M., Miyamoto, S., Nguyen, H.S., Słowiński, R. (eds.) RSCTC 2006. LNCS, vol. 4259, pp. 174–182. Springer, Heidelberg (2006). doi:10.1007/11908029_20

    Chapter  Google Scholar 

  12. 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 

  13. Zhu, P.: Covering rough sets based on neighborhoods: an approach without using neighborhoods. Int. J. Approx. Reas. 52(3), 461–472 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kumar, A., Banerjee, M.: Definable and rough sets in covering-based approximation spaces. In: Li, T., Nguyen, H.S., Wang, G., Grzymala-Busse, J., Janicki, R., Hassanien, A.E., Yu, H. (eds.) RSKT 2012. LNCS, vol. 7414, pp. 488–495. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31900-6_60

    Chapter  Google Scholar 

  15. 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, pp. 109–145. Springer, Heidelberg (2016)

    Chapter  Google Scholar 

  16. Skowron, A., Stepaniuk, J.: Information granules and rough-neural computing. In: Pal, S.K., Polkowski, L., Skowron, A. (eds.) Rough Neural Computing. Techniques for Computing with Words, p. 43. Springer, Berlin (2004)

    Chapter  Google Scholar 

  17. Skowron, A., Świniarski, R., Synak, P.: Approximation spaces and information granulation. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III. LNCS, vol. 3400, pp. 175–189. Springer, Heidelberg (2005). doi:10.1007/11427834_8

    Chapter  Google Scholar 

  18. Szczuka, M., Jankowski, A., Skowron, A., Ślęzak, D.: Building granular systems - from concepts to applications. In: Yao, Y., Hu, Q., Yu, H., Grzymala-Busse, J.W. (eds.) RSFDGrC 2015. LNCS, vol. 9437, pp. 245–255. Springer, Cham (2015). doi:10.1007/978-3-319-25783-9_22

    Chapter  Google Scholar 

  19. Polkowski, L., Skowron, A.: Rough mereology: a new paradigm for approximate reasoning. Int. J. Approx. Reas. 15, 333–365 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  20. Polkowski, L., Skowron, A.: Towards adaptive calculus of granules. In: Zadeh, L.A., Kacprzyk, J. (eds.) Computing with Words in Information/Intelligent Systems, pp. 201–227. Physica-Verlag, Heidelberg (1999)

    Chapter  Google Scholar 

  21. Polkowski, L., Artiemjew, P.: Granular Computing in Decision Approximation. An Application of Rough Mereology. Intelligent Systems Reference Library, vol. 77. Springer, Heidelberg (2015)

    MATH  Google Scholar 

  22. Artiemjew, P.: On classification of data by means of rough mereological granules of objects and rules. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS, vol. 5009, pp. 221–228. Springer, Heidelberg (2008). doi:10.1007/978-3-540-79721-0_33

    Chapter  Google Scholar 

  23. Bazan, J.G., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough set algorithms in classification problems. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications. New Developments in Knowledge Discovery in Information Systems, pp. 49–88. Physica Verlag, Heidelberg (2000)

    Chapter  Google Scholar 

  24. Grätzer, G.: General Lattice Theory, 2nd edn. Birkhauser Verlag, Basel (1998)

    MATH  Google Scholar 

  25. Staruch, B., Staruch, B.: Strong regular varieties of partial algebras. Algebra Univers. 31, 157–176 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  26. Staruch, B.: HSP-type Characterization of Strong Equational Classes of Partial Algebras, pp. 41–65 (2009)

    Google Scholar 

  27. Staruch, B., Staruch, B.: Possible sets of equations. Bull. Sect. Logic 32, 85–95 (2002)

    MathSciNet  MATH  Google Scholar 

  28. Staruch, B.: Derivation from partial knowledge in partial models. Bull. Sect. Logic 32, 75–84 (2002)

    MathSciNet  MATH  Google Scholar 

  29. Staruch, B.: Extensions of partial structures and their application to modelling of multi-agent systems, Advances in Soft Computing, Monitoring, Security and Rescue Tasks in Multiagent Systems. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  30. Staruch, B., Staruch, B.: First order theories for partial models. Stud. Logica. 80, 105–120 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, University of Warmia and Mazury in Olsztyn, ul. Słoneczna 54, 10-710, Olsztyn, Poland

    Bożena Staruch & Bogdan Staruch

Authors
  1. Bożena Staruch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bogdan Staruch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bożena Staruch .

Editor information

Editors and Affiliations

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

    Lech Polkowski

  2. University of Regina, Regina, Saskatchewan, 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

Staruch, B., Staruch, B. (2017). A Topological Approximation Space Based on Open Sets of Topology Generated by Coverings. In: Polkowski, L., et al. Rough Sets. IJCRS 2017. Lecture Notes in Computer Science(), vol 10314. Springer, Cham. https://doi.org/10.1007/978-3-319-60840-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60840-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60839-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation