How to make T-transitive a proximity relation
View/Open
151garmendia.pdf (184,2Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/19223
Document typeArticle
Defense date2009-02
Rights accessRestricted access - publisher's policy
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
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.
CitationGarmendia, 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.
ISSN1063-6706
Publisher versionhttp://ieeexplore.ieee.org/xpl/aboutJournal.jsp?punumber=91
Files | Description | Size | Format | View |
---|---|---|---|---|
151garmendia.pdf![]() | 184,2Kb | Restricted access |