Rough relations, neighborhood relations, and granular computing

Authors:
He Lin;Yao Zhou
Affiliations:
School of Information Science and Engineering, Lanzhou University, Lanzhou, People's Republic of China;School of Information Science and Engineering, Lanzhou University, Lanzhou, People's Republic of China and Huawei Technology Co., Ltd, Nanjing, People's Republic of China
Venue:
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
Year:
2011

Citing 5
Cited 0

Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic

Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Relational interpretations of neighborhood operators and rough set approximation operators

Information Sciences—Informatics and Computer Science: An International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
A Ten-year Review of Granular Computing

GRC '07 Proceedings of the 2007 IEEE International Conference on Granular Computing
The quotient space theory of problem solving

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on formal relationships in Pansystems, this paper discusses the notion of indistinguishability relations among some order pairs in a binary relation and introduces rough relations. A rough relation is a generalization of a rough set from a new multi-dimensional viewpoint. In an exponent poset, an indistinguishability relation can be interpreted as a neighborhood relation. By treating a neighborhood relation closure as a universe, the notion of rough degree can be introduced. An inherent relation of granular computing is interpretated based on rough relations.