Skip to main content

Comparing Transitive Closure with a New T-transitivization Method

  • Conference paper
Modeling Decisions for Artificial Intelligence (MDAI 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3131))

Abstract

It has been developed a C++ program that generates random fuzzy relations of a given dimension and computes their T-transitive closure (that contains the initial relation) and the new T-transitivized relation (that is contained in the initial relation) for the t-norms minimum, product and Lukasiewicz. It has been computed several distances between both transitive closure and transitivized relation with the initial relation one hundred times for each dimension and for each t-norm, and the results show that the average distance of the random fuzzy relations with the transitive closure is higher than the average distance with the new transitivized relation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garmendia, L., Campo, C., Cubillo, S., Salvador, A.: A Method to Make Some Fuzzy Relations T-Transitive. International Journal of Intelligence Systems 14(9), 873–882 (1999)

    Article  MATH  Google Scholar 

  2. Garmendia, L., Salvador, A.: On a new method to T-transitivize fuzzy relations. In: Information Processing and Management of Uncertainty in Knowledge - based Systems, IPMU 2000, pp. 864–869 (2000)

    Google Scholar 

  3. Garmendia, L., Salvador, A.: On a new method to T-transitivize fuzzy relations. In: Bouchon- Meunier, B., Gutierrez-Rios, J., Magdalena, L., Yager, R.R. (eds.) Technologies for Constructing Intelligent Systems 2, pp. 251–260. Springer, Heidelberg (2000)

    Google Scholar 

  4. Klir, G.J., Yuan, B.: Fuzzy Sets and Fuzzy Logic. Theory and Applications. Prentice Hall, New Jersey (1995)

    MATH  Google Scholar 

  5. Hashimoto, H.: Transitivity of generalized fuzzy matrices. Fuzzy Sets and Systems 17(1), 83–90 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Montero, F., Tejada, J.: On fuzzy transitivity. Instituto Nacional de Estadística 111, 49–58 (1986)

    Google Scholar 

  7. Naessens, H., De Meyer, H., De Baets, B.: Algorithms for the Computation of TTransitive Closures. IEEE Trans Fuzzy Systems 10(4), 541–551 (2002)

    Article  Google Scholar 

  8. Ovchinnikov, S.: Representations of Transitive Fuzzy Relations. In: Skala, H.J., Termini y, S., Trillas, E. (eds.) Aspects of Vagueness, pp. 105–118. Reidel Pubs., Boston (1984)

    Google Scholar 

  9. Schweizer, B., Sklar, A.: Probabilistic Metric Spaces. North-Holland, New York (1983)

    Google Scholar 

  10. Trillas, E., Alsina, C., Terricabras, J.M.: Introducción a la lógica borrosa . Ariel Matemática (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Garmendia, L., Salvador, A. (2004). Comparing Transitive Closure with a New T-transitivization Method. In: Torra, V., Narukawa, Y. (eds) Modeling Decisions for Artificial Intelligence. MDAI 2004. Lecture Notes in Computer Science(), vol 3131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27774-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27774-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22555-3

  • Online ISBN: 978-3-540-27774-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics