2017
DOI: 10.1214/17-aos1542
|View full text |Cite
|
Sign up to set email alerts
|

Estimating a probability mass function with unknown labels

Abstract: In the context of a species sampling problem we discuss a nonparametric maximum likelihood estimator for the underlying probability mass function. The estimator is known in the computer science literature as the high profile estimator. We prove strong consistency and derive the rates of convergence, for an extended model version of the estimator. We also study a sieved estimator for which similar consistency results are derived. Numerical computation of the sieved estimator is of great interest for practical p… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(22 citation statements)
references
References 36 publications
0
22
0
Order By: Relevance
“…More recently, ORLITSKY et al () introduced the high profile estimator , which extends the tail of the naive estimator to the region of unobserved types. ANEVSKI et al () improved this estimator and provided the consistency proof. Papers that address the rare Y‐STR haplotype problem in forensic context are for instance EGELAND and SALAS (), BRENNER (), CEREDA () and CEREDA ().…”
Section: The Rare Type Match Problemmentioning
confidence: 99%
“…More recently, ORLITSKY et al () introduced the high profile estimator , which extends the tail of the naive estimator to the region of unobserved types. ANEVSKI et al () improved this estimator and provided the consistency proof. Papers that address the rare Y‐STR haplotype problem in forensic context are for instance EGELAND and SALAS (), BRENNER (), CEREDA () and CEREDA ().…”
Section: The Rare Type Match Problemmentioning
confidence: 99%
“…The limitation of this method is that it cannot be used if N 2 = 0(this corresponds to an infinite likelihood ratio), and it does not perform well also in case the number of singletons is very small or zero. We believe it can be improved and extended by smoothing techniques (Good, ; Anevski et al, ), but we are going to ignore this problem.…”
Section: The Generalized‐good Methodsmentioning
confidence: 99%
“…More recently, Orlitsky et al [ 14 ] have introduced the high-profile estimator , which extends the tail of the naive estimator to the region of unobserved types. Anevski et al [ 15 ] improved this estimator and provided a consistency proof for their modified estimator (original authors only provided heuristic reasoning that turned out to be rather difficult to make rigorous).…”
Section: State Of the Artmentioning
confidence: 99%
“…Since it holds that for every accepted , we calculate the sum of all s such that and we use the average to approximate the denominator of ( 14 ). The algorithm is based on a similar one proposed in Anevski et al [ 15 ].…”
Section: Analysis On the Yhrd Databasementioning
confidence: 99%