Abstract
AbstractThere are fast algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute transitive openings from a given fuzzy relation. In this paper a method to compute a transitive opening of a reflexive and symmetric fuzzy relation is given. Even though there is not a unique transitive opening of a fuzzy relation, it is proved that the computed transitive opening closure is maximal.KeywordsTransitive ClosureFuzzy RelationProximity RelationFuzzy SimilarityTransitive OpeningThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call