Earth:Unseen species problem

Short description: Estimating the numbers of species

The unseen species problem is commonly referred to in ecology and deals with the estimation of the number of species represented in an ecosystem that were not observed by samples. It more specifically relates to how many new species would be discovered if more samples were taken in an ecosystem. The study of the unseen species problem was started in the early 1940s by Alexander Steven Corbet. He spent 2 years in British Malaya trapping butterflies and was curious how many new species he would discover if he spent another 2 years trapping. Many different estimation methods have been developed to determine how many new species would be discovered given more samples. The unseen species problem also applies more broadly, as the estimators can be used to estimate any new elements of a set not previously found in samples. An example of this is determining how many words William Shakespeare knew based on all of his written works.

The unseen species problem can be broken down mathematically as follows: If [math]\displaystyle{ n }[/math] independent samples are taken, [math]\displaystyle{ X^n \triangleq X_1, \ldots, X_n }[/math], and then if [math]\displaystyle{ m }[/math] more independent samples were taken, the number of unseen species that will be discovered by the additional samples is given by [math]\displaystyle{ U \triangleq U(X^n, X_{n+1}^{m+n}) \triangleq \left|\{X_{n+1}^{m+n}\} \setminus \{X^n\}\right|, }[/math] with [math]\displaystyle{ X_{n+1}^{m+n} \triangleq X_{n+1}, \ldots, X_{n+m} }[/math] being the second set of [math]\displaystyle{ m }[/math] samples.

History

In the early 1940s Alexander Steven Corbet spent 2 years in British Malaya trapping butterflies. He kept track of how many species he observed, and how many members of each species were captured. For example, there were 74 different species of which he captured only 2 individual butterflies.

When Corbet returned to the United Kingdom, he approached biostatistician Ronald Fisher and asked how many new species of butterflies he could expect to catch if he went trapping for another two years; in essence, Corbet was asking how many species he observed zero times.

Fisher responded with a simple estimation: for an additional 2 years of trapping, Corbet could expect to capture 75 new species. He did this using a simple summation (data provided by Orlitsky in the table from the Example below: [math]\displaystyle{ U = \sum_{i=1}^n (-1)^{i+1} \varphi_i = 118 - 74 + 44 - 24 + \cdots - 12 + 6 = 75. }[/math] Here [math]\displaystyle{ \varphi_i }[/math] corresponds to the number of individual species that were observed [math]\displaystyle{ i }[/math] times. Fisher's sum was later confirmed by Good–Toulmin.

Estimators

To estimate the number of unseen species, let [math]\displaystyle{ t \triangleq m/n }[/math] be the number of future samples ([math]\displaystyle{ m }[/math]) divided by the number of past samples ([math]\displaystyle{ n }[/math]), or [math]\displaystyle{ m = t n }[/math]. Let [math]\displaystyle{ \varphi_i }[/math] be the number of individual species observed [math]\displaystyle{ i }[/math] times (for example, if there were 74 species of butterflies with 2 observed members throughout the samples, then [math]\displaystyle{ \varphi_2 = 74 }[/math]).

The Good–Toulmin estimator

The Good–Toulmin (GT) estimator was developed by Good and Toulmin in 1953. The estimate of the unseen species based on the Good–Toulmin estimator is given by [math]\displaystyle{ U^\text{GT} \triangleq U^\text{GT}(X^n, t) \triangleq \sum_{i=1}^\infty (-t)^{i+1} \varphi_i. }[/math] The Good–Toulmin Estimator has been shown to be a good estimate for values of [math]\displaystyle{ t \leq 1. }[/math] The Good–Toulmin estimator also approximately satisfies [math]\displaystyle{ \operatorname{\mathbb E}(U^\text{GT} - U)^2 \lesssim nt^2. }[/math] This means that [math]\displaystyle{ U^\text{GT} }[/math] estimates [math]\displaystyle{ U }[/math] to within [math]\displaystyle{ \sqrt{n} \cdot t, }[/math] as long as [math]\displaystyle{ t \leq 1. }[/math]

However, for [math]\displaystyle{ t \gt 1, }[/math], the Good–Toulmin estimator fails to capture accurate results. This is because, if [math]\displaystyle{ t \gt 1, }[/math] [math]\displaystyle{ U^\text{GT} }[/math] increases by [math]\displaystyle{ (-t)^i \varphi_i }[/math] for [math]\displaystyle{ i }[/math] with [math]\displaystyle{ \varphi_i \gt 0, }[/math] meaning that if [math]\displaystyle{ \varphi_i \gt 0, }[/math] [math]\displaystyle{ U^\text{GT} }[/math] grows super-linearly in [math]\displaystyle{ t, }[/math] but [math]\displaystyle{ U }[/math] can grow at most linearly with [math]\displaystyle{ t. }[/math] Therefore, when [math]\displaystyle{ t \gt 1, }[/math] [math]\displaystyle{ U^\text{GT} }[/math] grows faster than [math]\displaystyle{ U }[/math] and does not approximate the true value.

To compensate for this, Efron and Thisted in 1976 showed that a truncated Euler transform can also be a usable estimate (the "ET" estimate): [math]\displaystyle{ U^\text{ET} \triangleq \sum_{i=1}^n h_h^\text{ET} \cdot \varphi_i, }[/math] with [math]\displaystyle{ h_i^\text{ET} \triangleq (-t)^{i+1} \cdot \mathbb{P}(X \geq i), }[/math] where [math]\displaystyle{ X \sim \operatorname{Bin}\left(k, \frac{1}{1 + t}\right), }[/math] and [math]\displaystyle{ \mathbb{P}(X \geq i) = \begin{cases} \displaystyle \sum_{j=i}^k \binom{k}{j} \frac{t^{k-j}}{(1 + t)^k} & \text{ for } i \leq k, \\ 0 & \text{ for } i \gt k, \end{cases} }[/math] where [math]\displaystyle{ k }[/math] is the location chosen to truncate the Euler transform.

The smoothed Good–Toulmin estimator

Similar to the approach by Efron and Thisted, Alon Orlitsky, Ananda Theertha Suresh, and Yihong Wu developed the smooth Good–Toulmin estimator. They realized that the Good–Toulmin estimator failed because of the exponential growth, and not its bias. Therefore, they estimated the number of unseen species by truncating the series [math]\displaystyle{ U^l \triangleq -\sum_{i=1}^l (-t)^i \varphi_i. }[/math] Orlitsky, Suresh, and Wu also noted that for distributions with [math]\displaystyle{ t \gt 1 }[/math], the driving term in the summation estimate is the [math]\displaystyle{ l-\text{th} }[/math] term, regardless of which value of [math]\displaystyle{ l }[/math] is chosen. To solve this, they selected a random nonnegative integer [math]\displaystyle{ L }[/math], truncated the series at [math]\displaystyle{ L }[/math], and then took the average over a distribution about [math]\displaystyle{ L }[/math]. The resulting estimator is [math]\displaystyle{ U^L = \operatorname{E}_L\left[-\sum_{i=1}^L (-t)^i \varphi_i\right]. }[/math] This method was chosen because the bias of [math]\displaystyle{ U^l }[/math] shifts signs due to the [math]\displaystyle{ (-t)^i }[/math] coefficient. Averaging over a distribution of [math]\displaystyle{ L }[/math] therefore reduces the bias. This means that the estimator can be written as the linear combination of the prevalence: [math]\displaystyle{ U^L = \operatorname{E}_L\left[-\sum_{i\geq 1} (-t)^i \varphi_i \mathbf{1}_{i\leq L}\right] = -\sum_{i \geq 1} (-t)^i \Pr(L \geq i) \varphi_i. }[/math] Depending on the distribution of [math]\displaystyle{ L }[/math] chosen, the results will vary. With this method, estimates can be made for [math]\displaystyle{ t \propto \ln n }[/math], and this is the best possible.

Species discovery curve

The species discovery curve can also be used. This curve relates the number of species found in an area as a function of the time. These curves can also be created by using estimators (such as the Good–Toulmin estimator) and plotting the number of unseen species at each value for [math]\displaystyle{ t }[/math].

A species discovery curve is always increasing, as there is never a sample that could decrease the number of discovered species. Furthermore, the species discovery curve is also decelerating – the more samples taken, the fewer unseen species are expected to be discovered. The species discovery curve will also never asymptote, as it is assumed that although the discovery rate might become infinitely slow, it will never actually stop. Two common models for a species discovery curve are the logarithmic and the exponential function.

Example – Corbet's butterflies

As an example, consider the data Corbet provided Fisher in the 1940s. Using the Good–Toulmin model, the number of unseen species is found using [math]\displaystyle{ U = -\sum_{i=1}^\infty (-t)^i \varphi_i. }[/math] This can then be used to create a relationship between [math]\displaystyle{ t }[/math] and [math]\displaystyle{ U }[/math].

Data provided to Fisher by Corbet

Number of observed members, [math]\displaystyle{ i }[/math]	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15
Number of species, [math]\displaystyle{ \varphi_i }[/math]	118	74	44	24	29	22	20	19	20	15	12	14	6	12	6

This relationship is shown in the plot below.

Number of unseen species as a function of t, the ratio of new samples to previous samples.

From the plot, it is seen that at [math]\displaystyle{ t = 1 }[/math], which was the value of [math]\displaystyle{ t }[/math] that Corbet brought to Fisher, the resulting estimate of [math]\displaystyle{ U }[/math] is 75, matching what Fisher found. This plot also acts as a species discovery curve for this ecosystem and defines how many new species will be discovered as [math]\displaystyle{ t }[/math] increases (and more samples are taken).

Other uses

There are numerous uses for the predictive algorithm. Knowing that the estimators are accurate, it allows scientists to extrapolate accurately the results of polling people by a factor of 2. They can predict the number of unique answers based on the number of people that have answered similarly. The method can also be used to determine the extent of someone's knowledge. A prime example is determining how many unique words Shakespeare knew based on the written works we have today.

Example – How many words did Shakespeare know?

Based on research of Shakespeare's known works done by Thisted and Efron, there are 884,647 total words. The research also found that there are at total of [math]\displaystyle{ N = 864 }[/math] different words that appear more than 100 times. Therefore, the total number of unique words was found to be 31,534. Applying the Good–Toulmin model, if an equal number of works by Shakespeare were discovered, then it is estimated that [math]\displaystyle{ U^\text{words} \approx 11{,}460 }[/math] unique words would be found. The goal would be to derive [math]\displaystyle{ U^\text{words} }[/math] for [math]\displaystyle{ t = \infty }[/math]. Thisted and Efron estimate that [math]\displaystyle{ U^\text{words}(t \to \infty) \approx 35{,}000 }[/math], meaning that Shakespeare most likely knew over twice as many words as he actually used in all of his writings.

See also

• Species discovery curve
• Alexander Steven Corbet
• Ronald Fisher
• German tank problem