A note on an iterative algorithm for nonparametric estimation in biased sampling models
A simple iterative estimation procedure for computing the nonparametric maximum likelihood estimator (NPMLE) in biased sampling models is discussed and studied in detail. A proof of convergence is provided. Numerical experiments show that the algorithm is significantly faster in terms of CPU time compared with the standard procedure.
Year of publication: |
2010
|
---|---|
Authors: | Davidov, Ori ; Iliopoulos, George |
Published in: |
Computational Statistics & Data Analysis. - Elsevier, ISSN 0167-9473. - Vol. 54.2010, 3, p. 620-624
|
Publisher: |
Elsevier |
Saved in:
Saved in favorites
Similar items by person
-
Order-Restricted Semiparametric Inference for the Power Bias Model
Davidov, Ori, (2010)
-
Semiparametric Inference for the Two-way Layout Under Order Restrictions
Davidov, OrI, (2014)
-
On the design of experiments with ordered treatments
Singh, Satya Prakash, (2019)
- More ...