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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Garmendia, L., & Salvador, A. (2005). A new algorithm to compute low T-transitive approximation of a fuzzy relation preserving symmetry. Comparisons with the T-transitive closure. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3571 LNAI, pp. 576–586). Springer Verlag. https://doi.org/10.1007/11518655_49
Mendeley helps you to discover research relevant for your work.