Granular Computing Based on a Generalized Approximation Space

摘要

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.