Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

TIT
2002

favoriteEmaildiscussreport

96views more TIT 2002»

An axiomatization of partition entropy

13 years 4 months ago

An axiomatization of partition entropy

Download www.cs.umb.edu

Abstract-- The aim of this paper is to present an axiomatization of a generalization of Shannon's entropy starting from partitions of finite sets. The proposed axiomatization yields as special cases the Havrda-Charvat entropy, and thus, provides axiomatizations for the Shannon entropy, the Gini index, and for other types of entropy used in classification and data mining. Keywords-- Shannon entropy, Gini index, Havrda-Charvat entropy, non-Shannon entropy.

Dan A. Simovici, Szymon Jaroszewicz

Real-time Traffic

Entropy | Havrda-Charvat Entropy | Shannon Entropy | TIT 2002 |

claim paper

Related Content

» On the Axiomatization of Generalized Entropic Metrics

» A mathematical review of the generalized entropies and their matrix trace inequalities

» An Abstract Axiomatization of the Notion of Entropy

» An axiomatization of entropy of capacities on set systems

» Comparing clusterings an axiomatic view

» Finding Median Partitions Using InformationTheoreticalBased Genetic Algorithms

» An Axiomatic Theory of Fairness in Network Resource Allocation

» On Properties of the Minimum Entropy Subtree to Compute Lower Bounds on the Partition Func...

» Entropies and CoEntropies of Coverings with Application to Incomplete Information Systems

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TIT
Authors	Dan A. Simovici, Szymon Jaroszewicz

Comments (0)