1999 | OriginalPaper | Chapter
Granular Computing using Neighborhood Systems
Author : Y. Y. Yao
Published in: Advances in Soft Computing
Publisher: Springer London
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A set-theoretic framework is proposed for granular computing. Each element of a universe is associated with a nonempty family of neighborhoods. A neighborhood of an element consists of those elements that are drawn towards that element by indistinguishability, similarity, proximity, or functionality. It is a granule containing the element. A neighborhood system is a family of granules, which is the available information or knowledge for granular computing. Operations on neighborhood systems, such as complement, intersection, and union, are defined by extending set-theoretic operations. They provide a basis of the proposed framework of granular computing. Using this framework, we examine the notions of rough sets and qualitative fuzzy sets.