By Topic

An axiomatization of partition entropy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Simovici, D.A. ; Dept. of Comput. Sci., Massachusetts Univ., Boston, MA, USA ; Jaroszewicz, S.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 7 )