2000
DOI: 10.1093/biomet/87.2.391
|View full text |Cite
|
Sign up to set email alerts
|

Mixtures of marginal models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
72
0

Year Published

2003
2003
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 61 publications
(72 citation statements)
references
References 27 publications
0
72
0
Order By: Relevance
“…We propose use of an EM algorithm for maximization of the composite-likelihood with respect to the hazard parameters. Although the EM algorithm is traditionally used for maximumlikelihood estimation in missing data problems, a similar algorithm can be more generally applied to any method that is based on unbiased estimating equations [e.g., Rosen et al, 2000]. In our application, the E-step of the algorithm involves computing the conditional probability of each relative being a carrier and a noncarrier, given their individual event history and the genotype of the index proband.…”
Section: Estimationmentioning
confidence: 99%
“…We propose use of an EM algorithm for maximization of the composite-likelihood with respect to the hazard parameters. Although the EM algorithm is traditionally used for maximumlikelihood estimation in missing data problems, a similar algorithm can be more generally applied to any method that is based on unbiased estimating equations [e.g., Rosen et al, 2000]. In our application, the E-step of the algorithm involves computing the conditional probability of each relative being a carrier and a noncarrier, given their individual event history and the genotype of the index proband.…”
Section: Estimationmentioning
confidence: 99%
“…As each C gi (t), conditional on group specific frailties ν gi , is a nonhomogeneous Poisson process, ability to self-adapt to varying levels of data complexity and provides a rich and flexible framework for counting process models. Quasi-likelihood inference (Heyde, 1997) for this model is discussed in Nielsen and Dean (2007) and utilizes an algorithm similar to the expectation-solution algorithm of Rosen et al (2000). Figure 4 shows plots of the estimated baseline intensities, λ g0 (t), and the estimated treatment effects, γ g1 , of the three-component model fitted to the cherry bark tortrix data.…”
Section: Modeling the Cherry Bark Tortrix Datamentioning
confidence: 99%
“…The MES algorithm is motivated from the ES (Expectation-Solution) algorithm (Hall and Zhang, 2004;Rosen, Jiang and Tanner, 2000) when the data are clustered. The ES algorithm combines elements of both GEE (Liang and Zeger, 1986) and the EM algorithms, so that one can account for dependency (clustering) in the data.…”
Section: Mes Algorithm Based On a Modified Newton-raphson Methodsmentioning
confidence: 99%
“…The ES algorithm combines elements of both GEE (Liang and Zeger, 1986) and the EM algorithms, so that one can account for dependency (clustering) in the data. However, the ES algorithm as prescribed by Rosen, Jiang and Tanner (2000) has a major limitation in that it is only applicable to an exponential dispersion family which has a form of 0 ÐC à 34 ) cannot be re-expressed in the exponential dispersion family form. As a consequence of this, the expectation of is not only related to but also to making a regression formulation complicated. ]…”
Section: Mes Algorithm Based On a Modified Newton-raphson Methodsmentioning
confidence: 99%
See 1 more Smart Citation