2015
DOI: 10.1111/biom.12366
|View full text |Cite
|
Sign up to set email alerts
|

Rediscovery of Good–Turing Estimators via Bayesian Nonparametrics

Abstract: Summary. The problem of estimating discovery probabilities originated in the context of statistical ecology, and in recent years it has become popular due to its frequent appearance in challenging applications arising in genetics, bioinformatics, linguistics, designs of experiments, machine learning, etc. A full range of statistical approaches, parametric and nonparametric as well as frequentist and Bayesian, has been proposed for estimating discovery probabilities. In this article, we investigate the relation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
17
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 23 publications
1
17
0
Order By: Relevance
“…Under the two-parameter PD prior, Favaro et al (2016) established a large n asymptotic relationship betweenD n (l) andĎ n (l). Due to the irregular behaviour of the m l,m 's, the peculiar dependency on m l+1,n makesĎ n (l) a sensible estimator only if l is sufficiently small with respect to n. See for instance Good (1953) and Sampson (2001) for examples of absurd estimates determined byĎ n (l).…”
Section: Preliminaries Ond N (L)mentioning
confidence: 99%
See 4 more Smart Citations
“…Under the two-parameter PD prior, Favaro et al (2016) established a large n asymptotic relationship betweenD n (l) andĎ n (l). Due to the irregular behaviour of the m l,m 's, the peculiar dependency on m l+1,n makesĎ n (l) a sensible estimator only if l is sufficiently small with respect to n. See for instance Good (1953) and Sampson (2001) for examples of absurd estimates determined byĎ n (l).…”
Section: Preliminaries Ond N (L)mentioning
confidence: 99%
“…See Chapter 7 in Sampson (2001) and references therein for a comprehensive account on smoothing techniques forĎ n (l). According to Theorem 1 in Favaro et al (2016), as n becomes large,D n (l) is asymptotically equivalent toĎ n (l; S PD ), where S PD denotes a smoothing rule such that…”
Section: Preliminaries Ond N (L)mentioning
confidence: 99%
See 3 more Smart Citations