Maximum transfer distance between partitions
From MaRDI portal
Publication:424003
DOI10.1007/s00357-006-0006-2zbMath1244.05023OpenAlexW2083700194MaRDI QIDQ424003
Olivier Hudry, Irène Charon, Alain Guénoche, Lucile Denœud
Publication date: 30 May 2012
Published in: Journal of Classification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00357-006-0006-2
Related Items (10)
Comparison of algorithms in graph partitioning ⋮ An efficient algorithm for computing the distance between close partitions ⋮ Minimum adjusted Rand index for two clusterings of a given size ⋮ Transfer distance between partitions ⋮ Two local dissimilarity measures for weighted graphs with application to protein interaction networks ⋮ Consensus of partitions: a constructive approach ⋮ Transfer distance between partitions and search of dense zones in graphs ⋮ A population background for nonparametric density-based clustering ⋮ Distribution and asymptotic behavior of the phylogenetic transfer distance ⋮ Bayesian nonparametric cross-study validation of prediction methods
This page was built for publication: Maximum transfer distance between partitions