{'fraction_non_alphanumeric': 0.02386934673366834, 'fraction_numerical': 0.0, 'mean_word_length': 5.42741935483871, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Granular Computing using Neighborhood Systems

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.