Some problems on the definition of fussy preference relations
Fuzzy Sets and Systems
Special properties, closures and interiors of crisp and fuzzy relations
Fuzzy Sets and Systems
Similarity relations: the calculation of minimal generating families
Fuzzy Sets and Systems
Fuzzy Sets and Systems
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 relation between fuzzy preorders and fuzzy consequence operators
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems - Special issue on selected papers on fuzzy logic and fuzzy technology from ESTYLF '98
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Transitive Solutions of Relational Equations on Finite Sets and Linear Lattices
IPMU '90 Proceedings of the 3rd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems: Uncertainty in Knowledge Bases
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
On the existence and construction of T-transitive closures
Information Sciences: an International Journal
The complete linkage clustering algorithm revisited
Soft Computing - A Fusion of Foundations, Methodologies and Applications
Benchmarking of high throughput computing applications on Grids
Parallel Computing
Transitivity of generalized fuzzy matrices
Fuzzy Sets and Systems
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Fuzzy Sets and Systems
Similarity relations and fuzzy orderings
Information Sciences: an International Journal
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Computing a transitive opening of a reflexive and symmetric fuzzy relation
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Algorithms for the computation of T-transitive closures
IEEE Transactions on Fuzzy Systems
Hi-index | 0.20 |
Since transitivity is quite often violated even by decision makers that accept transitivity in their preferences as a condition for consistency, a standard approach to deal with intransitive preference elicitations is the search for a close enough transitive preference relation, assuming that such a violation is mainly due to decision maker estimation errors. In some way, the more number of elicitations, the more probable inconsistency is. This is mostly the case within a fuzzy framework, even when the number of alternatives or object to be classified is relatively small. In this paper we propose a fast method to compute a T-indistinguishability from a reflexive and symmetric fuzzy relation, being T any left-continuous t-norm. The computed approximation we propose will take O(n^3) time complexity, where n is the number of elements under consideration, and is expected to produce a T-transitive opening. To the authors' knowledge, there are no other proposed algorithm that computes T-transitive lower approximations or openings while preserving the reflexivity and symmetry properties.