It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and computes their T-transitive closure and the new low T-transitive approximation. Average distances of the fuzzy relation with the T-transitive closure are similar than the average distances with the low T-transitive approximation.
['Luis Garmendia', 'Adela Salvador']
A new algorithm to compute low t-transitive approximation of a fuzzy relation preserving symmetry. comparisons with the t-transitive closure