How to make T-transitive a proximity relation

dc.contributor
Universitat Politècnica de Catalunya. Departament d'Estructures a l'Arquitectura
dc.contributor
Universitat Politècnica de Catalunya. FIA - Modelització Matemàtica Funcional i Aplicacions
dc.contributor.author
Garmendia Salvador, Luis
dc.contributor.author
Recasens Ferrés, Jorge
dc.date.issued
2009-02
dc.identifier
Garmendia, L.; Recasens, J. How to make T-transitive a proximity relation. "IEEE transactions on fuzzy systems", Febrer 2009, vol. 17, núm. 1, p. 200-207.
dc.identifier
1063-6706
dc.identifier
https://hdl.handle.net/2117/19223
dc.identifier
10.1109/TFUZZ.2008.2003128
dc.description.abstract
Three ways to approximate a proximity relation R (i.e., a reflexive and symmetric fuzzy relation) by a T -transitive one where T is a continuous Archimedean t-norm are given. The first one aggregates the transitive closure R macr of R with a (maximal) T-transitive relation B contained in R . The second one computes the closest homotecy of R macr or B to better fit their entries with the ones of R. The third method uses nonlinear programming techniques to obtain the best approximation with respect to the Euclidean distance for T the Lukasiewicz or the product t-norm. The previous methods do not apply for the minimum t-norm. An algorithm to approximate a given proximity relation by a min-transitive relation (a similarity) is given in the last section of the paper.
dc.description.abstract
Peer Reviewed
dc.description.abstract
Postprint (published version)
dc.format
8 p.
dc.format
application/pdf
dc.language
eng
dc.relation
http://ieeexplore.ieee.org/xpl/aboutJournal.jsp?punumber=91
dc.rights
Restricted access - publisher's policy
dc.subject
Àrees temàtiques de la UPC::Matemàtiques i estadística::Lògica matemàtica
dc.subject
Fuzzy logic
dc.subject
Lògica difusa
dc.title
How to make T-transitive a proximity relation
dc.type
Article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

E-prints [73025]