From the species problem to a general coverage problem via a new interpretation (Q1193368): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1214/aos/1176348672 / rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1214/aos/1176348672 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061461176 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1214/AOS/1176348672 / rank | |||
Normal rank |
Latest revision as of 16:11, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | From the species problem to a general coverage problem via a new interpretation |
scientific article |
Statements
From the species problem to a general coverage problem via a new interpretation (English)
0 references
27 September 1992
0 references
Three problems, apparently different, are studied under the same theoretical framework. They are: i) the structure of the species problem, ii) the problem of estimating the volume of a convex set and iii) the missile-coverage problem. The central idea consists of creating information about the unknown random quantity to be estimated, which depends on the sample \((X_ 1,\dots,X_ n)\), deleting one observation, then calculating the estimators with the \(n-1\) remaining observations and finally averaging those estimators. This methodology provides the explanation for the Turing-Good-Robbins estimator, in the species problem, and it also proves why this estimator is always biased. Moreover, this approach, mixed with an iterative procedure, yields an important bias reduction for the building estimators.
0 references
general coverage problem
0 references
new interpretation
0 references
species problem
0 references
estimating the volume of a convex set
0 references
missile-coverage problem
0 references
averaging
0 references
Turing- Good-Robbins estimator
0 references
iterative procedure
0 references
bias reduction
0 references