An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
There are diverse algorithms for the determination of the transitive closure of fuzzy relations [cf. \textit{J. C. Dunn}, J. Cybernetics 4 (1974), No. 2, 1-15 (1975; Zbl 0304.68094); \textit{H. B. Potoczny}, Fuzzy Sets Syst. 12, 231-235 (1984; Zbl 0547.68097); \textit{X. Xiao}, Fuzzy Math. 5(4), 71-73 (1985)]. The problem is simpler in the case of reflexive and symmetric fuzzy relations [similarity relations, cf. \textit{G. Fu}, Fuzzy Sets Syst. 51, No. 2, 189-194 (1992; Zbl 0787.62062)]. This paper brings the optimal algorithm for constructing the transitive closure of a reflexive and symmetric fuzzy relation on a finite set \(X\) (if \(\operatorname {card} X = n\), then computational complexity of the algorithm is \(O(n^{2})\)).
- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- scientific article; zbMATH DE number 3891544
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- scientific article; zbMATH DE number 2094780
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
- On the min-max composition of fuzzy matrices
- Two algorithms for fast incremental transitive closure of sparse fuzzy binary relations
- On convergence of the min-max compositions of fuzzy matrices
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- An efficient algorithm to determine M-matrix membership degree of fuzzy matrices
- A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- Automatic clustering of business processes in business systems planning
- Fuzzy Chains
- Fuzzy sets
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- On similarity relations in fuzzy relational databases
- Some Recent Investigations of a New Fuzzy Partitioning Algorithm and its Application to Pattern Classification Problems
- Computing a T-transitive lower approximation or opening of a proximity relation
- Optimization methods for fuzzy clustering
- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
- Minimizing cost travel in multimodal transport using advanced relation transitive closure
- Equivalent bipolar fuzzy relations
- Reduction method based on a new fuzzy rough set in fuzzy information system and its applications to scheduling problems
- Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
- Transitive opening of fuzzy similarity relation
- Two algorithms for fast incremental transitive closure of sparse fuzzy binary relations
- scientific article; zbMATH DE number 3851094 (Why is no real title available?)
- scientific article; zbMATH DE number 88951 (Why is no real title available?)
- scientific article; zbMATH DE number 1203228 (Why is no real title available?)
- Algorithms for computing the optimal transitive approximation of a proximity relation
- scientific article; zbMATH DE number 486959 (Why is no real title available?)
- On fuzzy preference relation in group decision making
- scientific article; zbMATH DE number 2094780 (Why is no real title available?)
- On the transitive closure of reciprocal \([0, 1]\)-valued relations
- A reflexive matrix contracting based square algorithm for calculating the transitive closure of a Boolean matrix
- Formal concept analysis based on fuzzy granularity base for different granulations
- An application of fuzzy hypergraphs and hypergraphs in granular computing
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- The structural clustering and analysis of metric based on granular space
- Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
This page was built for publication: An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951773)