An efficient algorithm for computing the distance between close partitions
From MaRDI portal
Publication:617900
DOI10.1016/j.dam.2010.09.002zbMath1209.68352OpenAlexW2109950620MaRDI QIDQ617900
Pascale Kuntz, Jin-Kao Hao, Daniel Cosmin Porumbel
Publication date: 14 January 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.09.002
similarity measureclustering comparisonpartition distancepartition metricsimilarity between partitions
Related Items
Memetic search for the max-bisection problem, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, A massively parallel evolutionary algorithm for the partial Latin square extension problem, Improving the extraction and expansion method for large graph coloring, Suppression distance computation for hierarchical clusterings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum transfer distance between partitions
- A constant-time dynamic storage allocator for real-time systems
- The complexity of computing metric distances between partitions
- Partition-distance: A problem and class of perfect graphs arising in clustering
- Hybrid evolutionary algorithms for graph coloring
- On constructing an optimal consensus clustering from multiple clusterings
- Transfer distance between partitions
- A procedure for the strategic planning of locations, capacities and districting of jails: application to Chile