Computer Science – Information Theory
Scientific paper
2011-03-30
Computer Science
Information Theory
14 pages, LaTeX
Scientific paper
We propose a compression-based version of the empirical entropy of a finite string over a finite alphabet. Whereas previously one considers the naked entropy of (possibly higher order) Markov processes, we consider the sum of the description of the random variable involved plus the entropy it induces. We assume only that the distribution involved is computable. To test the new notion we compare the Normalized Information Distance (the similarity metric) with a related measure based on Mutual Information in Shannon's framework. This way the similarities and differences of the last two concepts are exposed.
No associations
LandOfFree
On Empirical Entropy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Empirical Entropy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Empirical Entropy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-569651