A covering model of granular computing
Jian-Min Ma, Wen‐Xiu Zhang, Tong-Jun Li · 2005
This paper is mainly to study a covering model of granular computing in a set-theoretic setting. The model is based on the assumption that a finite set of universe is granulated through a family of overlapping granules based on a reflexive relation. Two operations, called zooming-in and zooming-out operations, are used to study connections between the elements of a universe and the elements of a granulated universe, as well as connections between computations in the two universes.