<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-06-29T07:34:21Z</responseDate><request verb="GetRecord" identifier="oai:docta.ucm.es:20.500.14352/50075" metadataPrefix="oai_dc">https://docta.ucm.es/rest/oai/request</request><GetRecord><record><header><identifier>oai:docta.ucm.es:20.500.14352/50075</identifier><datestamp>2024-11-26T15:17:33Z</datestamp><setSpec>com_20.500.14352_14</setSpec><setSpec>col_20.500.14352_15</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Computing a T-transitive lower approximation or opening of a proximity relation</dc:title>
   <dc:creator>Garmendia Salvador, Luis</dc:creator>
   <dc:creator>Salvador Alcaide, Adela</dc:creator>
   <dc:creator>Montero De Juan, Francisco Javier</dc:creator>
   <dc:subject>510.64</dc:subject>
   <dc:subject>Fuzzy relation</dc:subject>
   <dc:subject>Fuzzy proximity relation</dc:subject>
   <dc:subject>T-transitive relation</dc:subject>
   <dc:subject>fuzzy similarity</dc:subject>
   <dc:subject>T-indistinguishability</dc:subject>
   <dc:subject>T-transitive lower approximation</dc:subject>
   <dc:subject>T-transitive opening</dc:subject>
   <dc:subject>Lógica simbólica y matemática (Matemáticas)</dc:subject>
   <dc:subject>1102.14 Lógica Simbólica</dc:subject>
   <dc:description>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.</dc:description>
   <dc:description>Depto. de Estadística e Investigación Operativa</dc:description>
   <dc:description>Fac. de Ciencias Matemáticas</dc:description>
   <dc:description>TRUE</dc:description>
   <dc:description>pub</dc:description>
   <dc:date>2023-06-20T09:37:57Z</dc:date>
   <dc:date>2023-06-20T09:37:57Z</dc:date>
   <dc:date>2009</dc:date>
   <dc:type>journal article</dc:type>
   <dc:identifier>https://hdl.handle.net/20.500.14352/50075</dc:identifier>
   <dc:identifier>0165-0114</dc:identifier>
   <dc:identifier>10.1016/j.fss.2009.01.015</dc:identifier>
   <dc:language>eng</dc:language>
   <dc:relation>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</dc:relation>
   <dc:rights>restricted access</dc:rights>
   <dc:format>application/pdf</dc:format>
   <dc:publisher>Elsevier Science Bv</dc:publisher>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>