An Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Fuzzy Proximity
نویسندگان
چکیده
A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computational cost of computing just one. The shape of the binary partition tree for the three output similarities are the same.
منابع مشابه
An algorithm to compute a T-transitive opening of a proximity
There are fast known algorithms to compute the transitive closure of a fuzzy relation, but there are only a few different algorithms that compute T-transitive low approximations of a fuzzy relation. A fast method to compute a T-transitive low approximation of a reflexive and symmetric fuzzy relation is given for any continuous tnorm, spending O(n) time.
متن کاملClustering Methods Based on Weighted Quasi-Arithmetic Means of T-Transitive Fuzzy Relations
In this paper we propose clustering methods based on weighted quasiarithmetic means of T -transitive fuzzy relations. We first generate a T -transitive closure R from a proximity relation R based on a max-T composition and produce a T -transitive lower approximation or opening RT from the proximity relation R through the residuation operator. We then aggregate a new T -indistinguishability fuzz...
متن کاملAn Algorithm to Compute the Transitive Closure, a Transitive Approximation and a Transitive Opening of a Proximity*
Equivalence relations are important in many branches of knowledge and especially in Classification theories and Cluster Analysis since they generate a partition on the universe of discourse and permit to classify their elements and make clusters. In many cases the relation we start with is not an equivalence relation but only a reflexive and symmetric one. A very important family of fuzzy relat...
متن کاملA T-transitive opening of a proximity
A fast method to compute a T-transitive opening of a proximity is given for any tnorm, spending O(n) time. Even though there is not a unique T-transitive approximation of a fuzzy relation, it is proved that the computed T-transitive opening is maximal.
متن کاملA New Algorithm to Compute Low T-Transitive Approximation of a Fuzzy Relation Preserving Symmetry. Comparisons with the T-Transitive Closure
It is given a new algorithm to compute a lower T-transitive approximation of a fuzzy relation that preserves symmetry. Given a reflexive and symmetric fuzzy relation, the new algorithm computes a T-indistinguishability that is contained in the fuzzy relation. It has been developed a C++ program that generates random symmetric fuzzy relations or random symmetric and reflexive fuzzy relations and...
متن کامل