Pages that link to "Item:Q1170849"
From MaRDI portal
The following pages link to The complexity of computing metric distances between partitions (Q1170849):
Displayed 15 items.
- Clustering and isolation in the consensus problem for partitions (Q578812) (← links)
- The role of complexity in comparing classifications (Q585631) (← links)
- Properties of Levenshtein metrics on sequences (Q792096) (← links)
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks (Q949442) (← links)
- Transfer distance between partitions and search of dense zones in graphs (Q976980) (← links)
- SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index (Q991943) (← links)
- Approximating minimum-length-sequence metrics: A cautionary note (Q1050904) (← links)
- A computationally efficient approximation to the nearest neighbor interchange metric (Q1057598) (← links)
- Comparison of classifications using measures intermediate between metric dissimilarity and consensus similarity (Q1091712) (← links)
- Consensus-based partitions in the space of ordered partitions (Q1102843) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- Lattice-based similarity measures between ordered trees (Q1838813) (← links)
- Consensus system for solving conflicts in distributed systems (Q1857039) (← links)
- Comparison of algorithms in graph partitioning (Q3163669) (← links)
- Certain calculational aspects of the clusterization problem (Q5185850) (← links)