Granular computing based on a generalized approximation space

Authors:
Jian-Min Ma;Wen-Xiu Zhang;Wei-Zhi Wu;Tong-Jun Li
Affiliations:
Institute for Information and System Sciences, Faculty of Science, Xi'an Jiaotong University, Xi'an, Shaan'xi, P.R. China;Institute for Information and System Sciences, Faculty of Science, Xi'an Jiaotong University, Xi'an, Shaan'xi, P.R. China;Mathematics, Physics and Information College, Zhejiang Ocean University, Zhoushan, Zhejiang, P.R. China;Institute for Information and System Sciences, Faculty of Science, Xi'an Jiaotong University, Xi'an, Shaan'xi, P.R. China and Mathematics, Physics and Information College, Zhejiang Ocean Universit ...
Venue:
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Year:
2007

Citing 4
Cited 3

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?
Induction of Classification Rules by Granular Computing

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

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Fuzzy logic = computing with words

IEEE Transactions on Fuzzy Systems

Knowledge acquisition in inconsistent multi-scale decision systems

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

Transactions on Rough Sets XV
Rough set approximations in incomplete multi-scale information systems

RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of overlapping granules can be formed by granulating a finite universe under a binary relation in a set-theoretic setting. In this paper, we granulate a universe by a binary relation and obtain a granular universe. And then we define two kinds of operators between these two universes, study properties of them. By combining these two kinds of operators, we get two pairs of approximation operators. It is proved that one kind of combination operators is just the approximation operators under a generalized approximation space defined according to Pawlak's rough set theory.