Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation.
DOI10.1016/S0377-2217(02)00730-0zbMATH Open1043.90087OpenAlexW2030968866WikidataQ60258317 ScholiaQ60258317MaRDI QIDQ1428064FDOQ1428064
H. De Meyer, H. Naessens, B. De Baets
Publication date: 14 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00730-0
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
Programming involving graphs or networks (90C35) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)
Cites Work
- Special properties, closures and interiors of crisp and fuzzy relations
- Similarity relations and fuzzy orderings
- Abstract derivation of transitive closure algorithms
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph
- A Graph Theoretic Analysis of Pattern Classification via Tamura's Fuzzy Relation
- Fuzzy Chains
- Efficient computation of transitive closures
- An algorithm for computing the transitive closure of a fuzzy similarity matrix
- The simplest method of ascending value to find fuzzy transitive closure
Cited In (19)
- Equivalent bipolar fuzzy relations
- On the \(T_L\)-transitivity of fuzzy similarity measures
- UPGMA clustering revisited: a weight-driven approach to transitive approximation
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
- Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets
- Algorithms for computing the optimal transitive approximation of a proximity relation
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
- On the compositional characterization of complete fuzzy pre-orders
- 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
- Title not available (Why is that?)
- Closing reciprocal relations w.r.t. stochastic transitivity
- Title not available (Why is that?)
- 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)
