Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
From MaRDI portal
(Redirected from Publication:1428064)
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
- scientific article; zbMATH DE number 3891544
- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- A representation theorem for min-transitive fuzzy relations
- Two algorithms for fast incremental transitive closure of sparse fuzzy binary relations
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- Transitive approximation of fuzzy relations by alternating closures and openings
Cites work
- A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
- Abstract derivation of transitive closure algorithms
- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
- Efficient computation of transitive closures
- Fuzzy Chains
- Similarity relations and fuzzy orderings
- Special properties, closures and interiors of crisp and fuzzy relations
- The simplest method of ascending value to find fuzzy transitive closure
Cited in
(21)- Equivalent bipolar fuzzy relations
- On the \(T_L\)-transitivity of fuzzy similarity measures
- UPGMA clustering revisited: a weight-driven approach to transitive approximation
- Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
- Algorithms for computing the optimal transitive approximation of a proximity relation
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- On the compositional characterization of complete fuzzy pre-orders
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
- On the transitivity of a parametric family of cardinality-based similarity measures
- The role a fuzzy implication plays in a multi-criteria decision algorithm
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Fuzzy relations for the analysis of traders' preferences in an information market game
- Formal concept analysis based on fuzzy granularity base for different granulations
- Lattice-valued F-transforms and similarity relations
- scientific article; zbMATH DE number 88951 (Why is no real title available?)
- Closing reciprocal relations w.r.t. stochastic transitivity
- scientific article; zbMATH DE number 6130361 (Why is no real title available?)
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity
- The stability of local properties of fuzzy relations under ordinal equivalence
This page was built for publication: Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428064)
