Fuzzy sets and fuzzy logic: theory and applications
Fuzzy sets and fuzzy logic: theory and applications
On transitive solutions of fuzzy equations, inequalities and lower approximations of fuzzy relations
Fuzzy Sets and Systems - Special issue: fuzzy relations, part 2
Fuzzy T-transitive relations: eigenvectors and generators
Fuzzy Sets and Systems - Special issue on fuzzy relations, part 1
On the relationship between T-transitivity and approximate equality
Fuzzy Sets and Systems - Theme: Basic notions
On a new method to T-transitive fuzzy relations
Technologies for constructing intelligent systems
Transitivity of generalized fuzzy matrices
Fuzzy Sets and Systems
Similarity relations and fuzzy orderings
Information Sciences: an International Journal
Algorithms for the computation of T-transitive closures
IEEE Transactions on Fuzzy Systems
Computing a T-transitive lower approximation or opening of a proximity relation
Fuzzy Sets and Systems
Hi-index | 0.00 |
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 computes their T-transitive closure and the new low T-transitive approximation. Average distances of the fuzzy relation with the T-transitive closure are similar than the average distances with the low T-transitive approximation.