Granular computing based on fuzzy similarity relations
- First Online:
- Cite this article as:
- Degang, C., Yongping, Y. & Hui, W. Soft Comput (2011) 15: 1161. doi:10.1007/s00500-010-0583-1
- 272 Views
Rough sets and fuzzy rough sets serve as important approaches to granular computing, but the granular structure of fuzzy rough sets is not as clear as that of classical rough sets since lower and upper approximations in fuzzy rough sets are defined in terms of membership functions, while lower and upper approximations in classical rough sets are defined in terms of union of some basic granules. This limits further investigation of the existing fuzzy rough sets. To bring to light the innate granular structure of fuzzy rough sets, we develop a theory of granular computing based on fuzzy relations in this paper. We propose the concept of granular fuzzy sets based on fuzzy similarity relations, investigate the properties of the proposed granular fuzzy sets using constructive and axiomatic approaches, and study the relationship between granular fuzzy sets and fuzzy relations. We then use the granular fuzzy sets to describe the granular structures of lower and upper approximations of a fuzzy set within the framework of granular computing. Finally, we characterize the structure of attribute reduction in terms of granular fuzzy sets, and two examples are also employed to illustrate our idea in this paper.