Sufficiently near sets of neighbourhoods

Authors:
James F. Peters
Affiliations:
Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, Univ. of Manitoba, Winnipeg, MB
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 3
Cited 3

Near Sets. Special Theory about Nearness of Objects

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Foundations of near sets

Information Sciences: an International Journal
ε-near collections

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology

On Graded Nearness of Sets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach

Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
Soft Nearness Approximation Spaces

Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The focus of this paper is on sets of neighbourhoods that are sufficiently near each other as yet another way to consider near sets. This study has important implications in M. Katetov's approach to topologising a set. A pair of neighbourhoods of points are sufficiently near, provided that the Čech distance between the neighbourhoods is less than some number ε. Sets of neighbourhoods are sufficiently near, provided the Čech distance between the sets of neighbourhoods is less than some number ε.