Estimating a Logistic Weibull Mixture Models with Long–Term Survivors
نویسندگان
چکیده
منابع مشابه
Identifiability of multivariate logistic mixture models
Mixture models have been widely used in modeling of continuous observations. For the possibility to estimate the parameters of a mixture model consistently on the basis of observations from the mixture, identifiability is a necessary condition. In this study, we give some results on the identifiability of multivariate logistic mixture models.
متن کاملEstimating K in Genetic Mixture Models
A key quantity in the analysis of structured populations is the parameter K, which describes the number of subpopulations that make up the total population. Inference of K ideally proceeds via the model evidence, which is equivalent to the likelihood of the model. However, the evidence in favour of a particular value of K cannot usually be computed exactly, and instead programs such as STRUCTUR...
متن کاملEstimating Mixture of Dirichlet Process Models
Current Gibbs sampling schemes in mixture of Dirichlet process (MDP) models are restricted to using \conjugate" base measures which allow analytic evaluation of the transition probabilities when resampling con gurations, or alternatively need to rely on approximate numeric evaluations of some transition probabilities. Implementation of Gibbs sampling in more general MDP models is an open and im...
متن کاملEstimating linear functionals in Poisson mixture models
This paper concerns the problem of estimating linear functionals of the mixing distribution from Poisson mixture observations. In particular, linear functionals for which parametric rate of convergence cannot be achieved are studied. It appears that Gaussian functionals are rather easy to estimate. Estimation of the distibution functions is then considered by approximating this functional by Ga...
متن کاملEstimating Mixture Models via Mixtures of Polynomials
Mixture modeling is a general technique for making any simple model more expressive through weighted combination. This generality and simplicity in part explains the success of the Expectation Maximization (EM) algorithm, in which updates are easy to derive for a wide class of mixture models. However, the likelihood of a mixture model is non-convex, so EM has no known global convergence guarant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknologi
سال: 2012
ISSN: 2180-3722,0127-9696
DOI: 10.11113/jt.v45.323