1999
DOI: 10.1111/1467-842x.00075
|View full text |Cite
|
Sign up to set email alerts
|

Theory & Methods: An EM algorithm for estimating negative binomial parameters

Abstract: An EM algorithm is proposed for computing estimates of parameters of the negative binomial distribution; the algorithm does not involve further iterations in the M-step, in contrast with the one given in Schader & Schmid (1985). The approach can be applied to the corresponding problem in the logarithmic series distribution. The convergence of the proposed scheme is investigated by simulation, the observed Fisher information is derived and numerical examples based on real data are presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
9
1

Relationship

0
10

Authors

Journals

citations
Cited by 27 publications
(11 citation statements)
references
References 5 publications
0
11
0
Order By: Relevance
“…As pointed out by Little and Rubin (1983), the EM algorithm converge reliably but rather slowly, compared with the Newton-Raphson method, when the amount of information in the missing data is relatively large. Recently, EM algorithm has been used by such researchers as Adamidis and Loukas (1998), Adamidis (1999), Ng et al (2002), Karlis (2003), and Adamidis et al (2005).…”
Section: Em Algorithmmentioning
confidence: 99%
“…As pointed out by Little and Rubin (1983), the EM algorithm converge reliably but rather slowly, compared with the Newton-Raphson method, when the amount of information in the missing data is relatively large. Recently, EM algorithm has been used by such researchers as Adamidis and Loukas (1998), Adamidis (1999), Ng et al (2002), Karlis (2003), and Adamidis et al (2005).…”
Section: Em Algorithmmentioning
confidence: 99%
“…The NBRM was explored in Adamidis (1999); Greene (2008); Lawless (1987aLawless ( , 1987b, and Raschke and Greene (2010); Hilbe (2011) and Hilbe (2014) provide useful recent surveys of the NBRM. 10 Common variants of this argument include: (i) Lee (1986), who specifies the gamma distribution in terms of the shape and scale (or inverse rate) (ξ = 1/η) parameters, that is, θ ∼ G(1/ξ, τ), and (ii) Cameron and Trivedi (1986), who use the so-called index form of the gamma distribution, which is specified in terms of the shape and mean (φ = τ/η) parameters, that is, θ ∼ G(τ/φ, τ).…”
Section: The Classical Negative Binomial Regression Modelmentioning
confidence: 99%
“…The main drawback of the EM algorithm is its rather slow convergence, compared to the Newton-Raphson method, when the "missing data" contain relatively large amount of information (Little and Rubin, 1983). Recently, several researchers have used the EM method such as Adamidis et al (2005), Karlis (2003), Ng et al (2002), Adamidis and Loukas (1998), Adamidis (1999), among others. Newton-Raphson is required for the M-step of the EM algorithm.…”
Section: Estimationmentioning
confidence: 99%