Computing a T-transitive lower approximation or opening of a proximity relation

Garmendia Salvador, Luis; Salvador Alcaide, Adela y Montero de Juan, Javier (2008). Computing a T-transitive lower approximation or opening of a proximity relation. "Fuzzy Sets and Systems", v. 160 (n. 14); pp. 2097-2105. ISSN 0165-0114. https://doi.org/10.1016/j.fss.2009.01.015.

Descripción

Título: Computing a T-transitive lower approximation or opening of a proximity relation
Autor/es:
  • Garmendia Salvador, Luis
  • Salvador Alcaide, Adela
  • Montero de Juan, Javier
Tipo de Documento: Artículo
Título de Revista/Publicación: Fuzzy Sets and Systems
Fecha: Julio 2008
Volumen: 160
Materias:
Escuela: E.T.S.I. Caminos, Canales y Puertos (UPM)
Departamento: Matemática e Informática Aplicadas a la Ingeniería Civil [hasta 2014]
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (263kB) | Vista Previa

Resumen

Fuzzy Sets and Systems. IMPACT FACTOR: 1,181. Fuzzy Sets and Systems. IMPACT FACTOR: 1,181. Since transitivity is quite often violated even by decision makers that accept transitivity in their preferences as a condition for consistency, a standard approach to deal with intransitive preference elicitations is the search for a close enough transitive preference relation, assuming that such a violation is mainly due to decision maker estimation errors. In some way, the more number of elicitations, the more probable inconsistency is. This is mostly the case within a fuzzy framework, even when the number of alternatives or object to be classified is relatively small. In this paper we propose a fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation, being T any left-continuous t-norm. The computed approximation we propose will take O(n3) time complexity, where n is the number of elements under consideration, and is expected to produce a T-transitive opening. To the authors¿ knowledge, there are no other proposed algorithm that computes T-transitive lower approximations or openings while preserving the reflexivity and symmetry properties.

Más información

ID de Registro: 3055
Identificador DC: http://oa.upm.es/3055/
Identificador OAI: oai:oa.upm.es:3055
Identificador DOI: 10.1016/j.fss.2009.01.015
URL Oficial: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V05-4VKP3T0-1-1&_cdi=5637&_user=885385&_pii=S0165011409000554&_orig=browse&_coverDate=07/16/2009&_sk=998399985&view=c&wchp=dGLbVzz-zSkWA&md5=b1660ae3af7b2354627fce2a36e61f35&ie=/sdarticle.pdf
Depositado por: Memoria Investigacion
Depositado el: 17 May 2010 11:43
Ultima Modificación: 20 Abr 2016 12:37
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM