RT Book, Section
T1 Computing a T-transitive opening of a proximity
A1 Garmendia Salvador, Luis
A1 Salvador Alcaide, Adela
A1 Montero De Juan, Francisco Javier
A2 Ruan, Da
A2 Montero De Juan, Francisco Javier
AB A fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation is given for any left-continuous t-norm, taking O(n(3)) time complexity, where n is the number of elements in the universe. It is proved that the computed fuzzy relation is a T-transitive opening when T is the minimum t-norm or a strictly growing t-norm. As far as we know, this is the first known algorithm that computes T-transitive openings preserving the reflexive and symmetric properties.
PB World Scientific
SN 978-981-279-946-3
YR 2008
FD 2008-09
LK https://hdl.handle.net/20.500.14352/53160
UL https://hdl.handle.net/20.500.14352/53160
LA eng
NO Garmendia, L., Salvador, A., Montero, J.: COMPUTING A T-TRANSITIVE OPENING OF A PROXIMITY. En: Computational Intelligence in Decision and Control. pp. 157-162. WORLD SCIENTIFIC, Madrid, Spain (2008)
NO 8th International Conference on Fuzzy Logic and Intelligent Technologies in Nuclear Science.Madrid, Spain, 21-24 September 2008
DS Docta Complutense
RD 9 abr 2025