Answers are grounded in this paper and cite their sources.
We introduce an axiomatization of entropy that generates, as special cases, novel entropy types. These entropies generalize Shannon’s entropy and allow the introduction of entropy for partitions of sets of objects located in metric spaces, and for partitions of sets of vertices in undirected graphs. Corresponding metrics on the sets of partitions are introduced. Also, we hint to applications of these metrics for evaluation of clustering quality.
No takes yet. Share an insight, caveat, or question.
Dan A. Simovici (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: