An axiomatization of partition entropy
Dan A. Simovici, Szymon Jaroszewicz · IEEE Transactions on Information Theory · 2002
The aim of this article is to present an axiomatization of a generalization of Shannon's entropy starting from partitions of finite sets. The proposed axiomatization defines a family of entropies depending on a real positive parameter that contains as a special case the Havrda-Charvat (1967) entropy, and thus, provides axiomatizations for the Shannon entropy, the Gini index, and for other types of entropy used in classification and data mining.