2026-06-27T15:20:24Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/500752024-11-26T15:17:33Zcom_20.500.14352_14col_20.500.14352_15

Garmendia Salvador, Luis Salvador Alcaide, Adela Montero De Juan, Francisco Javier 2023-06-20T09:37:57Z 2023-06-20T09:37:57Z 2009 Garmendia, L., Salvador, A., Montero, J.: Computing a T-transitive lower approximation or opening of a proximity relation. Fuzzy Sets and Systems. 160, 2097-2105 (2009). https://doi.org/10.1016/j.fss.2009.01.015 0165-0114 10.1016/j.fss.2009.01.015 https://hdl.handle.net/20.500.14352/50075 https//doi.org/10.1016/j.fss.2009.01.015 http://www.sciencedirect.com/science/article/pii/S0165011409000554 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. eng restricted access Computing a T-transitive lower approximation or opening of a proximity relation journal article