Maximum transfer distance between partitions
From MaRDI portal
Publication:424003
DOI10.1007/S00357-006-0006-2zbMATH Open1244.05023OpenAlexW2083700194MaRDI QIDQ424003FDOQ424003
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
Recommendations
Cited In (11)
- Transfer distance between partitions and search of dense zones in graphs
- Bayesian nonparametric cross-study validation of prediction methods
- Comparison of algorithms in graph partitioning
- Consensus of partitions: a constructive approach
- An efficient algorithm for computing the distance between close partitions
- On Application of the Partition Distance Concept to a Comparative Analysis of Psychological or Sociological Tests
- Transfer distance between partitions
- Minimum adjusted Rand index for two clusterings of a given size
- Two local dissimilarity measures for weighted graphs with application to protein interaction networks
- A population background for nonparametric density-based clustering
- Distribution and asymptotic behavior of the phylogenetic transfer distance
This page was built for publication: Maximum transfer distance between partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424003)