A new algorithm to compute low t-transitive approximation of a fuzzy relation preserving symmetry. comparisons with the t-transitive closure

  • Authors:
  • Luis Garmendia;Adela Salvador

  • Affiliations:
  • Facultad de Informática, Dpto. de Lenguajes y Sistemas Informáticos, Universidad Complutense of Madrid, Madrid, Spain;E.T.S.I. Caminos Canales y Puertos, Dpto. de Matemática Aplicada, Technical University of Madrid, Madrid, Spain

  • Venue:
  • ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.