Pages that link to "Item:Q1428064"
From MaRDI portal
The following pages link to Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (Q1428064):
Displayed 15 items.
- Fuzzy relational inequalities and equations, fuzzy quasi-orders, closures and openings of fuzzy sets (Q277558) (← links)
- Algorithms for computing the optimal transitive approximation of a proximity relation (Q422457) (← links)
- Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge (Q551956) (← links)
- Formal concept analysis based on fuzzy granularity base for different granulations (Q695251) (← links)
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- On the compositional characterization of complete fuzzy pre-orders (Q835209) (← links)
- On the transitivity of a parametric family of cardinality-based similarity measures (Q962835) (← links)
- Lattice-valued \(F\)-transforms and similarity relations (Q1795136) (← links)
- The stability of local properties of fuzzy relations under ordinal equivalence (Q2214984) (← links)
- Equivalent bipolar fuzzy relations (Q2269187) (← links)
- Closing reciprocal relations w.r.t. stochastic transitivity (Q2350477) (← links)
- Fuzzy relations for the analysis of traders' preferences in an information market game (Q2378441) (← links)
- On the \(T_L\)-transitivity of fuzzy similarity measures (Q2398062) (← links)
- UPGMA clustering revisited: a weight-driven approach to transitive approximation (Q2506948) (← links)
- The role a fuzzy implication plays in a multi-criteria decision algorithm (Q2845282) (← links)