An algorithm for computing the transitive closure of a fuzzy similarity matrix
From MaRDI portal
(Redirected from Publication:1311751)
Recommendations
- An optimal algorithm for computing the max-min 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
- On the \(T_L\)-transitivity of fuzzy similarity measures
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Transitive approximation of fuzzy relations by alternating closures and openings
- scientific article; zbMATH DE number 1819917
- scientific article; zbMATH DE number 486959
Cites work
Cited in
(11)- A clustering method to identify representative financial ratios
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- Dual fuzzy similarity relation equations
- Optimization methods for fuzzy clustering
- Iterates of fuzzy circulant matrices
- UPGMA clustering revisited: a weight-driven approach to transitive approximation
- scientific article; zbMATH DE number 2094780 (Why is no real title available?)
- Automatic clustering of business processes in business systems planning
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
This page was built for publication: An algorithm for computing the 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 Q1311751)