Determining the number of samples required to estimate entropy in natural sequences
Calculating the Shannon entropy for symbolic sequences has been widely considered in
many fields. For descriptive statistical problems such as estimating the N-gram entropy of …
many fields. For descriptive statistical problems such as estimating the N-gram entropy of …
To BEE or not to BEE: Estimating more than Entropy with Biased Entropy Estimators
Entropy estimation plays a significant role in biology, economics, physics, communication
engineering and other disciplines. It is increasingly used in software engineering, eg in …
engineering and other disciplines. It is increasingly used in software engineering, eg in …
Transitive entropy—a rank ordered approach for natural sequences
Information theoretic entropy measures are calculated from estimates of the probabilities of
the constituent symbolic events. In natural sequences, such as those occurring in human …
the constituent symbolic events. In natural sequences, such as those occurring in human …
A pragmatic entropy and differential entropy estimator for small datasets
A pragmatic approach for entropy estimation is presented, first for discrete variables, then in
the form of an extension for handling continuous and/or multivariate ones. It is based on …
the form of an extension for handling continuous and/or multivariate ones. It is based on …
Entropy Estimation Using a Linguistic Zipf–Mandelbrot–Li Model for Natural Sequences
Entropy estimation faces numerous challenges when applied to various real-world
problems. Our interest is in divergence and entropy estimation algorithms which are capable …
problems. Our interest is in divergence and entropy estimation algorithms which are capable …
Fast entropy estimation for natural sequences
It is well known that to estimate the Shannon entropy for symbolic sequences accurately
requires a large number of samples. When some aspects of the data are known it is …
requires a large number of samples. When some aspects of the data are known it is …
On estimating the alphabet size of a discrete random source
P Ginzboorg - arxiv preprint arxiv:1711.07545, 2017 - arxiv.org
We are concerned with estimating alphabet size $ N $ from a stream of symbols taken
uniformly at random from that alphabet. We define and analyze a memory-restricted variant …
uniformly at random from that alphabet. We define and analyze a memory-restricted variant …
[PDF][PDF] Symbolic Dynamic Analysis through Coincidence Detection–an Oversimplified Method
A very pragmatic approach for measuring memory (or inertia) in dynamic sequences of
symbols (symbol dynamics) is proposed, where only intervals between coincidences of …
symbols (symbol dynamics) is proposed, where only intervals between coincidences of …