Some Models of Granular Computing

This paper discusses forms and structures of some important models of granular computing. A class of models is called relation based models, which are induced by equivalence relations, more general, by general binary relations or neighborhood systems. Another class of models of granular computing, called covering based models, are proposed and discussed in detail, which are induced by coverings of the given universe.