Algorithms for computing the optimal transitive approximation of a proximity relation

DOI10.1007/s00500-010-0658-zzbMath1237.03034OpenAlexW1994877243MaRDI QIDQ422457

Guan Nan Deng, Kai Hu, Hong-Xing Li

Publication date: 16 May 2012

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-010-0658-z

zbMATH Keywords

fuzzy similarity relationproximity relationtransitive approximation

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Fuzzy clustering method based on perturbation
• Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
• Computing a T-transitive lower approximation or opening of a proximity relation
• Special properties, closures and interiors of crisp and fuzzy relations
• Fuzzy clustering methods based on perturbation
• Structure of transitive valued binary relations
• Transitive approximation of fuzzy relations by alternating closures and openings
• Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
• Algorithms for transitive closure
• Similarity relations and fuzzy orderings
• An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix

This page was built for publication: Algorithms for computing the optimal transitive approximation of a proximity relation