2026-07-31T10:18:45Zhttps://docta.ucm.es/rest/oai/requestoai:docta.ucm.es:20.500.14352/531602024-11-26T15:19:15Zcom_20.500.14352_14col_20.500.14352_21
Docta Complutense
author
Garmendia Salvador, Luis
author
Salvador Alcaide, Adela
author
Montero De Juan, Francisco Javier
editor
Ruan, Da
editor
Montero De Juan, Francisco Javier
2023-06-20T13:38:30Z
2023-06-20T13:38:30Z
2008-09
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)
978-981-279-946-3
10.1142/9789812799470_0026
https://hdl.handle.net/20.500.14352/53160
https//doi.org/10.1142/9789812799470_0026
http://eproceedings.worldscinet.com/9789812799470/9789812799470_0026.html
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.
eng
Computing a T-transitive opening of a proximity
book part
URL
https://docta.ucm.es/bitstreams/1e31e208-7a8a-4fba-9df8-7a59ec558c51/download
File
MD5
f7579228b3e9e22898c7a607eddc2a8d
57247
application/pdf
Montero136.pdf
URL
https://docta.ucm.es/bitstreams/1e12847c-d739-4d0e-ada3-bd1f91fe4c3b/download
File
MD5
14dc91ecbf3b22be4cda6cda7fadd089
14285
text/plain
Montero136.pdf.txt