Sufficiently Near Neighbourhoods of Points in Flow Graphs. A Near Set Approach

Authors:
James F. Peters;Doungrat Chitcharoen
Affiliations:
Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 51-V6, Canada and School of Mathematics, University of Hydera ...;Computational Intelligence Laboratory, Department of Electrical & Computer Engineering, University of Manitoba, Winnipeg, Manitoba R3T 51-V6, Canada. doungratmath@gmail.com
Venue:
Fundamenta Informaticae - Cognitive Informatics and Computational Intelligence: Theory and Applications
Year:
2013

Citing 7
Cited 0

Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs

TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Foundations of near sets

Information Sciences: an International Journal
Sufficiently near sets of neighbourhoods

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

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Rough sets and flow graphs

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Flow graphs and data mining

Transactions on Rough Sets III
Near Sets. Special Theory about Nearness of Objects

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces sufficiently near visual neighbourhoods of points and neighbourhoods of sets in digital image flow graphs NDIFGs. An NDIFG is an extension of a Pawlak flow graph. The study of sufficiently near neighbourhoods in NDIFGs stems from recent work on near sets and topological spaces via near and far, especially in terms of visual neighbourhoods of points that are sufficiently near each other. From a topological perspective, non-spatially near sets represent an extension of proximity space theory and the original insight concerning spatially near sets by F. Riesz at the International Congress of Mathematicians ICM in 1908. In the context of Herrlich nearness, sufficiently near neighbourhoods of sets in NDIFGs provide a new perspective on topological structures in NDIFGs. The practical implications of this work are significant. With the advent of a study of the nearness of open as well as closed neighbourhods of points and of sets in NDIFGs, it is now possible to do information mining on a more global level and achieve new insights concerning the visual information embodied in the images that provide input to an NDIFG.