Fuzzy approximations of fuzzy relational structures

In social network analysis, relational structures play a crucial role in the processing of complex data. This paper proposes a fuzzy relational structure which consists of a non-empty universal set and a set of fuzzy relations of finite arity. In order to deduce knowledge hidden in a fuzzy relational structure we present the concept of bisimulations as indiscernibility with respect to the fuzzy relational structure. Furthermore, we give a method of computing the largest bisimulations over fuzzy relational structures and present computational examples of the method. Finally, the fuzzy rough set analysis of fuzzy relational structures is discussed.