Pages that link to "Item:Q1311751"
From MaRDI portal
The following pages link to An algorithm for computing the transitive closure of a fuzzy similarity matrix (Q1311751):
Displaying 10 items.
- Computationally efficient sup-t transitive closure for sparse fuzzy binary relations (Q812624) (← links)
- Optimization methods for fuzzy clustering (Q1291518) (← links)
- Automatic clustering of business processes in business systems planning (Q1296364) (← links)
- Iterates of fuzzy circulant matrices (Q1319440) (← links)
- Dual fuzzy similarity relation equations (Q1328832) (← links)
- Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. (Q1428064) (← links)
- A clustering method to identify representative financial ratios (Q2476753) (← links)
- UPGMA clustering revisited: a weight-driven approach to transitive approximation (Q2506948) (← links)
- An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a fuzzy proximity (Q2853332) (← links)
- An optimal algorithm for computing the max-min transitive closure of a fuzzy similarity matrix (Q5951773) (← links)
