𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Speed-up for the expectation-maximization algorithm for clustering categorical data

✍ Scribed by F. -X. Jollois; M. Nadif

Publisher
Springer US
Year
2006
Tongue
English
Weight
261 KB
Volume
37
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Expectation–maximization algorithm for r
Expectation–maximization algorithm for regression, deconvolution and smoothing of shot-noise limited data
✍ S. E. Bialkowski πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 845 KB

A simple algorithm for deconvolution and regression of shot-noise-limited data is illustrated in this paper. The algorithm is easily adapted to almost any model and converges to the global optimum. Multiplecomponent spectrum regression, spectrum deconvolution and smoothing examples are used to illus

Using the EM-algorithm for survival data
Using the EM-algorithm for survival data with incomplete categorical covariates
✍ Stuart R. Lipsitz; Joseph G. Ibrahim πŸ“‚ Article πŸ“… 1996 πŸ› Springer 🌐 English βš– 507 KB

Incomplete covariate data is a common occurrence in many studies in which the outcome is survival time. With generalized linear models, when the missing covariates are categorical, a useful technique for obtaining parameter estimates is the EM by the method of weights proposed in Ibrahim (1990). In