A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Entropy rate constancy in text
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Estimating Entropy Rates with Bayesian Confidence Intervals
Neural Computation
Bias reduction via linear combination of nearest neighbour entropy estimators
International Journal of Information and Coding Theory
Universal Estimation of Information Measures for Analog Sources
Foundations and Trends in Communications and Information Theory
A Methodology to Predicate Human-Being's Movement Based on Movement Group
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Predictability of individuals' mobility with high-resolution positioning data
Proceedings of the 2012 ACM Conference on Ubiquitous Computing
Breaking the habit: Measuring and predicting departures from routine in individual human mobility
Pervasive and Mobile Computing
| Hi-index | 754.84 |
We discuss a family of estimators for the entropy rate of a stationary ergodic process and prove their pointwise and mean consistency under a Doeblin-type mixing condition. The estimators are Cesaro averages of longest match-lengths, and their consistency follows from a generalized ergodic theorem due to Maker (1940). We provide examples of their performance on English text, and we generalize our results to countable alphabet processes and to random fields