Skip to main content

Pre-topologies and Dynamic Spaces

  • Conference paper
  • First Online:
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2003)

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

Abstract

Approximation Spaces were introduced in order to analyse data on the basis of Indiscernibility Spaces, that is, spaces of the form 〈U, E〉, where U is the universe of data and E is an equivalence relation on U. Various authors suggested considering spaces of the form 〈U, R〉, where R is any relation. This paper aims at introducing a further step consisting in spaces of the form 〈U, {R}iI〉, where {R}iI〉 is a family of relations on U, that we call “Dynamic Spaces”, because they make it possible to account for different forms of dynamics. While Indiscernibility Spaces induce 0-dimensional topological spaces (Approximation Spaces), Dynamic Spacess induce various types of pre-topological spaces.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belmandt, Z.: Manuel de prétopologie et ses applications. Hermes, 1993.

    Google Scholar 

  2. Cech E.: Topological Spaces. John Wiley and Sons, 1966.

    Google Scholar 

  3. Lin T. Y.: Granular Computing on Binary Relations. I and II. In Polkowski L. & Skowron A. (Eds.) Rough Sets in Knowledge Discovery. 1: Methodology and Applications, Physica-Verlag, 1988, pp. 107–121 and 122–140.

    Google Scholar 

  4. Pagliani P.: Modalizing Relations by means of Relations. In Proceeding of IPMU’ 98, July, 6–10, 1998. “La Sorbonne”, Paris, France, pp. 1175–1182.

    Google Scholar 

  5. Pagliani P.: Concrete neighbourhood systems and formal pretopological spaces. (Draft, 2002)

    Google Scholar 

  6. Pawlak, Z.: Rough sets. Theoretical Aspects of Reasoning about Data. Kluwer Acad. Publ., 1991.

    Google Scholar 

  7. Skowron A. & Stepaniuk J.: Approximation of Relations. In W. Ziarko (ed.): Rough Sets, Fuzzy Sets and Knowledge Discovery, Springer-Verlag, 1994, pp. 161–166.

    Google Scholar 

  8. Yao Y. Y. & Lin T. Y.: Graded Rough Set Approximations based on Nested Neighborhood Systems. In Proceeding of EUFIT’ 97. Vol 1. ELIT-Foundation, Aachen, 1997, pp. 196–200.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pagliani, P. (2003). Pre-topologies and Dynamic Spaces. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2003. Lecture Notes in Computer Science(), vol 2639. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39205-X_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-39205-X_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14040-5

  • Online ISBN: 978-3-540-39205-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics