|
Título:
|
Computing a T-transitive lower approximation or opening of a proximity relation.
|
|
Autores:
|
Garmendia, L. ;
Salvador, A ;
Montero, Javier
|
|
Tipo de documento:
|
texto impreso
|
|
Editorial:
|
Elsevier Science BV, 2009
|
|
Dimensiones:
|
application/pdf
|
|
Nota general:
|
info:eu-repo/semantics/restrictedAccess
|
|
Idiomas:
|
|
|
Palabras clave:
|
Estado = Publicado
,
Materia = Ciencias: Matemáticas: Lógica simbólica y matemática
,
Tipo = Artículo
|
|
Resumen:
|
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 higher the number of elicitations, the more probable is inconsistency. This is mostly the case within a fuzzy framework, even when the number of alternatives or objects 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, T being any left-continuous t-norm. The computed approximation we propose will have 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 is no other proposed algorithm that computes T-transitive lower approximations or openings while preserving the reflexivity and symmetry properties.
|
|
En línea:
|
https://eprints.ucm.es/id/eprint/16156/1/Montero17.pdf
|
