Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Soft Computing
Published in: Soft Computing 5/2011

01-05-2011 | Original Paper

Algorithms for computing the optimal transitive approximation of a proximity relation

Authors: Guan Nan Deng, Kai Hu, Hong Xing Li

Published in: Soft Computing | Issue 5/2011

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Three ways for generating the optimal transitive approximations or a suboptimal transitive approximation are given in this paper. The first one can obtain all the optimal transitive approximations for any proximity relation. However, trying to find all the optimal transitive approximations can be very expensive. The second one gives a method to obtain a suboptimal transitive approximation which can frequently generate an optimal transitive approximation. Furthermore, starting from the transitive closure the third method is proposed which can obtain a locally optimal transitive approximation. Finally, numerical experiments are carried out to show the abilities of these algorithms and compare them to other existing approximation algorithms.
previous article Fuzzy classification in dynamic environments

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now
Literature
Dawyndt P, De Meyer H, De Baets B (2004) On the min-transitive approximation of symmetric fuzzy relations. In: Proceedings of 2004 IEEE international conference on fuzzy systems, pp 167–171
De Baets B, De Meyer H (2002) T-transitive closures, openings and approximations of similarity relations. In: Proceedings of the 2002 IEEE international conference on fuzzy systems, pp 1375–1380
De Baets B, De Meyer H (2003) Transitive approximation of fuzzy relations by alternating closures and openings. Soft Comput 7:210–219MATH
De Meyer H, Naessens H, De Baets B (2004) Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. Eur J Oper Res 155:226–238CrossRefMATHMathSciNet
Fodor JC, Roubens M (1995) Structure of transitive valued binary relations. Math Soc Sci 30:71–94CrossRef
Garmendia L, Salvador A, Montero J (2009) Computing a T-transitive lower approximation or opening of aproximity relation. Fuzzy Sets Syst 160:2097–2105CrossRefMATHMathSciNet
Garmendia L, Recasens J (2009) How to make T-transitive a proximity relation. IEEE Trans Fuzzy Syst 17:200–207CrossRef
Garmendia L, González R, López V, Recasens J (2009) An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity. Mathware & Soft Comput 16:175–191
Koubkov A, Koubek V (2002) Algorithms for transitive closure. Inf Process Lett 81:289–296CrossRef
Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Proceedings of 2nd Berkeley symposium, pp 481–492
Lee HS (2001) An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix. Fuzzy Sets Syst 123:129–136CrossRefMATH
Leonard DB (2002) Convexity and optimization in R n . Wiley, New YorkMATH
Naessens H, DeMeyer H, DeBaets B (2002) Algorithms for the computation of T-transitive closures. IEEE Trans Fuzzy Syst 10:541–551CrossRef
Steven RL (1982) Convex sets and their application. Wiley, New York
Wallace M, Avrithis Y, Kollias S (2006) Computationally efficient sup-t transitive closure for sparse fuzzy binary relations. Fuzzy Sets Syst 157:341–372CrossRefMATHMathSciNet
Metadata
Title
Algorithms for computing the optimal transitive approximation of a proximity relation
Authors
Guan Nan Deng
Kai Hu
Hong Xing Li
Publication date
01-05-2011
Publisher
Springer-Verlag
Published in
Soft Computing / Issue 5/2011
Print ISSN: 1432-7643
Electronic ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-010-0658-z

Other articles of this Issue 5/2011

Soft Computing 5/2011 Go to the issue

Focus

Stabilization of nonlinear time-delay systems with input saturation via anti-windup fuzzy design

Focus

Efficient approaches for summarizing subspace clusters into k representatives

Original Paper

Improving the performance of differential evolution algorithm using Cauchy mutation

Original Paper

Optimization algorithms for large-scale real-world instances of the frequency assignment problem

Focus

Generalized intuitionistic fuzzy geometric aggregation operator and its application to multi-criteria group decision making

Focus

A modified hybrid method of spatial credibilistic clustering and particle swarm optimization

Premium Partner

    Image Credits