Good–Turing frequency estimation

Good–Turing frequency estimation is a statistical technique for estimating the probability of encountering an object of a hitherto unseen species, given a set of past observations of objects from different species. In drawing balls from an urn, the 'objects' would be balls and the 'species' would be the distinct colors of the balls (finite but unknown in number). After drawing ${\displaystyle R_{\text{red}}}$ red balls, ${\displaystyle R_{\text{black}}}$ black balls and ${\displaystyle R_{\text{green}}}$ green balls, we would ask what is the probability of drawing a red ball, a black ball, a green ball or one of a previously unseen color.

Historical background

Good–Turing frequency estimation was developed by Alan Turing and his assistant I. J. Good as part of their methods used at Bletchley Park for cracking German ciphers for the Enigma machine during World War II. Turing at first modelled the frequencies as a multinomial distribution, but found it inaccurate. Good developed smoothing algorithms to improve the estimator's accuracy.

The discovery was recognized as significant when published by Good in 1953,[1] but the calculations were difficult so it was not used as widely as it might have been.[2] The method even gained some literary fame due to the Robert Harris novel Enigma.

In the 1990s, Geoffrey Sampson worked with William A. Gale of AT&T to create and implement a simplified and easier-to-use variant of the Good–Turing method[3][4] described below. Various heuristic justifications[5] and a simple combinatorial derivation have been provided.[6]

The method

Notation

• Assuming that X distinct species have been observed, numbered x = 1, ..., X.
• Then the frequency vector, ${\displaystyle {\bar {R}}}$, has elements ${\displaystyle R_{x}}$ that give the number of individuals that have been observed for species x.
• The frequency of frequencies vector, ${\displaystyle (N_{r})_{r=0,1,\ldots }}$, shows how many times the frequency r occurs in the vector R; i.e. among the elements ${\displaystyle R_{x}}$.

${\displaystyle N_{r}=|\{x\mid R_{x}=r\}|}$

For example, ${\displaystyle N_{1}}$ is the number of species for which only one individual was observed. Note that the total number of objects observed, N, can be found from

${\displaystyle N=\sum _{r=1}^{\infty }rN_{r}.}$

The first step in the calculation is to estimate the probability that a future observed individual (or the next observed individual) is a member of a thus far unseen species. This estimate is:[7]

${\displaystyle p_{0}={\frac {N_{1}}{N}}.}$

The next step is to estimate the probability that the next observed individual is from a species which has been seen r times. For a single species this estimate is:

${\displaystyle p_{r}={\frac {(r+1)S(N_{r+1})}{NS(N_{r})}}.}$

To estimate the probability that the next observed individual is from any species from this group (i.e., the group of species seen r times) one can use the following formula:

${\displaystyle {\frac {(r+1)S(N_{r+1})}{N}}.}$

Here, the notation ${\displaystyle S()}$ means the smoothed or adjusted value of the frequency shown in parenthesis (see also empirical Bayes method). An overview of how to perform this smoothing follows.

We would like to make a plot of ${\displaystyle \log N_{r}}$ versus ${\displaystyle \log r}$ but this is problematic because for large r many ${\displaystyle N_{r}}$ will be zero. Instead a revised quantity, ${\displaystyle \log Z_{r}}$, is plotted versus ${\displaystyle \log r}$, where Z_r is defined as

${\displaystyle Z_{r}={\frac {N_{r}}{0.5(t-q)}},}$

and where q, r and t are consecutive subscripts having ${\displaystyle N_{q},N_{r},N_{t}}$ non-zero. When r is 1, take q to be 0. When r is the last non-zero frequency, take t to be 2r − q.

The assumption of Good–Turing estimation is that the number of occurrence for each species follows a binomial distribution.[8]

A simple linear regression is then fitted to the log–log plot. For small values of r it is reasonable to set ${\displaystyle S(N_{r})=N_{r}}$ (that is, no smoothing is performed), while for large values of r, values of ${\displaystyle S(N_{r})}$ are read off the regression line. An automatic procedure (not described here) can be used to specify at what point the switch from no smoothing to linear smoothing should take place.[9] Code for the method is available in the public domain.[10]

Derivation

Many different derivations of the above formula for ${\displaystyle p_{r}}$ have been given.[1][6][8]

One of the simplest ways to motivate the formula is by assuming the next item will behave similarly to the previous item. The overall idea of the estimator is that currently we are seeing never-seen items at a certain frequency, seen-once items at a certain frequency, seen-twice items at a certain frequency, and so on. Our goal is to estimate just how likely each of these categories is, for the next item we will see. Put another way, we want to know the current rate at which seen-twice items are becoming seen-thrice items, and so on. Since we don't assume anything about the underlying probability distribution, it does sound a bit mysterious at first. But it is extremely easy to calculate these probabilities empirically for the previous item we saw, even assuming we don't remember exactly which item that was: Take all the items we have seen so far (including multiplicities) — the last item we saw was a random one of these, all equally likely. Specifically, the chance that we saw an item for the (r+1)'th time is simply the chance that it was one of the items that we have now seen r+1 times, namely ${\displaystyle {\frac {(r+1)N_{r+1}}{N}}}$. In other words, our chance of seeing an item that had been seen r times before was ${\displaystyle {\frac {(r+1)N_{r+1}}{N}}}$. So now we simply assume that this chance will be about the same for the next item we see. This immediately gives us the formula above for ${\displaystyle p_{0}}$, by setting ${\displaystyle r=0}$. And for ${\displaystyle r>0}$, to get the probability that a particular one of the ${\displaystyle N_{r}}$ items is going to be the next one seen, we need to divide this probability (of seeing some item that has been seen r times) among the ${\displaystyle N_{r}}$ possibilities for which particular item that could be. This gives us the formula ${\displaystyle \;p_{r}={\frac {(r+1)N_{r+1}}{NN_{r}}}}$. Of course, your actual data will probably be a bit noisy, so you will want to smooth the values first to get a better estimate of how quickly the category counts are growing, and this gives the formula as shown above. This approach is in the same spirit as deriving the standard Bernoulli estimator by simply asking what the two probabilities were for the previous coin flip (after scrambling the trials seen so far), given only the current result counts, while assuming nothing about the underlying distribution.

See also

• Ewens sampling formula
• Pseudocount

References

1. Good, I.J. (1953). "The population frequencies of species and the estimation of population parameters". Biometrika. 40 (3–4): 237–264. doi:10.1093/biomet/40.3-4.237. JSTOR 2333344. MR 0061330.
2. Newsise: Scientists Explain and Improve Upon 'Enigmatic' Probability Formula, a popular review of Orlitsky A, Santhanam NP, Zhang J (2003). "Always Good Turing: asymptotically optimal probability estimation". Science. 302 (5644): 427–31. Bibcode:2003Sci...302..427O. doi:10.1126/science.1088284. PMID 14564004.
3. Sampson, Geoffrey and Gale, William A. (1995) Good‐turing frequency estimation without tears
4. Orlitsky, Alon; Suresh, Ananda (2015). "Competitive distribution estimation: Why is Good-Turing Good?" (PDF). Neural Information Processing Systems (NIPS): 1–9. Retrieved 28 March 2016.
5. Nadas, A. (1991). "Good, Jelinek, Mercer, and Robbins on Turing's Estimate of Probabilities". American Journal of Mathematical and Management Sciences. American Sciences Press Syracuse, NY, USA. 11 (3–4): 299–308. doi:10.1080/01966324.1991.10737313.
6. Hutter, Marcus (2014). "Offline to Online Conversion". Proc. 25th International Conf. on Algorithmic Learning Theory (ALT'14). LNAI. 8776. Bled, Slovenia: Springer. pp. 230–244. arXiv:1407.3334. doi:10.1007/978-3-319-11662-4_17.
7. Gale, William A. (1995). "Good–Turing smoothing without tears". Journal of Quantitative Linguistics. 2 (3): 3. CiteSeerX 10.1.1.110.8518. doi:10.1080/09296179508590051.
8. Lecture 11: The Good–Turing Estimate. CS 6740, Cornell University, 2010
9. Church, K; Gale, W (1991). "A comparison of the enhanced Good–Turing and deleted estimation methods for estimating probabilities of English bigrams". Cite journal requires |journal= (help)
10. Sampson, Geoffrey (2005) Simple Good–Turing Frequency Estimator (code in C)

Bibliography

• David A. McAllester, Robert Schapire (2000) On the Convergence Rate of Good–Turing Estimators, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory pp. 1–6
• David A. McAllester, Ortiz, Luis (2003) Concentration Inequalities for the Missing Mass and for Histogram Rule Error, Journal of Machine Learning Research pp. 895–911