The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
Abstract
A generalisation of the ecm algorithm (Meng & Rubin, 1993), which is itself an extension of the em algorithm (Dempster, Laird & Rubin, 1977), can be obtained by replacing some CM-steps of ECM, which maximise the constrained expected complete-data loglikelihood function, with steps that maximise the correspondingly constrained actual likelihood function. This algorithm, which we call ecme algorithm, for Expectation/Conditional Maximisation Either, shares with both em and ecm their stable monotone convergence and basic simplicity of implementation relative to competing faster converging methods. Moreover, ecme can have a substantially faster convergence rate than either EM or ECM, measured using either the number of iterations or actual computer time. There are two reasons for this improvement. First, in some of ECME'S maximisation steps, the actual likelihood is being conditionally maximised, rather than a current approximation to it, as with EM and ECM. Secondly, ecme allows faster converging numerical methods to be used on only those constrained maximisations where they are most efficacious. Illustrative ecme algorithms are presented with both closed-form and iterative CM-steps, which demonstrate the faster rate of convergence and the associated easier assessment of convergence. Also, theoretical expressions are presented and illustrated regarding the rate of convergence of ecme. Finally, relationships with Markov chain Monte Carlo methods are discussed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Statistical Analysis With Missing Data
Lahiff, M., Little, R. J. A., & Rubin, D. B. (1989) · Journal of the American Statistical Association · doi:10.2307/2289883 · Cited by 17,265
Self-citationInference from iterative simulation using multiple sequences
Gelman, A., & Rubin, D. B. (1992) · Statistical Science · doi:10.1214/ss/1177011136 · Cited by 16,627
Self-citationRUBIN, D. B. (1976) · Biometrika · doi:10.1093/biomet/63.3.581 · Cited by 9,925
Self-citationRandom-Effects Models for Longitudinal Data
Laird, N. M., & Ware, J. H. (1982) · Biometrics · doi:10.2307/2529876 · Cited by 8,923
Sampling-based approaches to calculating marginal densities
Gelfand, A. E., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10476213 · Cited by 6,606
On the Statistical Analysis of Dirty Pictures
Besag, J. (1986) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1986.tb01412.x · Cited by 4,191
On the Convergence Properties of the EM Algorithm
Wu, C. F. J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346060 · Cited by 3,269
Maximum Likelihood Approaches to Variance Component Estimation and to Related Problems
Harville, D. A. (1977) · Journal of the American Statistical Association · doi:10.1080/01621459.1977.10480998 · Cited by 2,667
Finding the Observed Information Matrix When Using the EM Algorithm
Louis, T. A. (1982) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1982.tb01203.x · Cited by 2,229
Maximum likelihood estimation via the ECM algorithm: A general framework
MENG, X.-L., & RUBIN, D. B. (1993) · Biometrika · doi:10.1093/biomet/80.2.267 · Cited by 1,861
Self-citationBayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods
Smith, A. F. M., & Roberts, G. O. (1993) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1993.tb01466.x · Cited by 1,713
Unbalanced Repeated-Measures Models with Structured Covariance Matrices
Jennrich, R. I., & Schluchter, M. D. (1986) · Biometrics · doi:10.2307/2530695 · Cited by 1,325
Smith, J. Q., Bernardo, J. M., Berger, J. O., Dawid, A. P., & Smith, A. F. M. (1993) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2982740 · Cited by 1,097
Robust Statistical Modeling Using the t Distribution
Lange, K. L., Little, R. J. A., & Taylor, J. M. G. (1989) · Journal of the American Statistical Association · doi:10.1080/01621459.1989.10478852 · Cited by 1,039
Illustration of Bayesian Inference in Normal Data Models Using Gibbs Sampling
Gelfand, A. E., Hills, S. E., Racine-Poon, A., & Smith, A. F. M. (1990) · Journal of the American Statistical Association · doi:10.1080/01621459.1990.10474968 · Cited by 969
The Collapsed Gibbs Sampler in Bayesian Computations with Applications to a Gene Regulation Problem
Liu, J. S. (1994) · Journal of the American Statistical Association · doi:10.1080/01621459.1994.10476829 · Cited by 641
Maximum-likelihood estimation for the mixed analysis of variance model
HARTLEY, H. O., & RAO, J. N. K. (1967) · Biometrika · doi:10.1093/biomet/54.1-2.93 · Cited by 617
EM Algorithms for ML Factor Analysis
Rubin, D. B., & Thayer, D. T. (1982) · Psychometrika · doi:10.1007/bf02293851 · Cited by 603
Self-citationLIU, J. S., WONG, W. H., & KONG, A. (1994) · Biometrika · doi:10.1093/biomet/81.1.27 · Cited by 542
Maximum Likelihood Computations with Repeated Measures: Application of the EM Algorithm
Laird, N., Lange, N., & Stram, D. (1987) · Journal of the American Statistical Association · doi:10.1080/01621459.1987.10478395 · Cited by 406
Robust Estimation of the Mean and Covariance Matrix from Data with Missing Values
Little, R. J. A. (1988) · Applied Statistics · doi:10.2307/2347491 · Cited by 191
Conjugate Gradient Acceleration of the EM Algorithm
Jamshidian, M., & Jennrich, R. I. (1993) · Journal of the American Statistical Association · doi:10.1080/01621459.1993.10594313 · Cited by 176
Spatial statistics and Bayesian computation (with discussion)
Besag, J. E., & Green, P. J. (1993) · Bristol Research (University of Bristol) · Cited by 119
On the Rate of Convergence of the ECM Algorithm
Meng, X. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325371 · Cited by 117
On the global and componentwise rates of convergence of the EM algorithm
Meng, X., & Rubin, D. B. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90363-8 · Cited by 82
Self-citationMissing Data Imputation Using the Multivariate t Distribution
Liu, C. (1995) · Journal of Multivariate Analysis · doi:10.1006/jmva.1995.1029 · Cited by 74
Self-citation
Cited by
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Systematic Protein Location Mapping Reveals Five Principal Chromatin Types in Drosophila Cells
Filion, G. J., van Bemmel, J. G., Braunschweig, U., Talhout, W., Kind, J., Ward, L. D., Brugman, W., de Castro, I. J., Kerkhoven, R. M., Bussemaker, H. J., et al. (2010) · Cell · doi:10.1016/j.cell.2010.09.009 · Cited by 964
Robust mixture modelling using the t distribution
Peel, D., & McLachlan, G. J. (2000) · Statistics and Computing · doi:10.1023/a:1008981510081 · Cited by 947
Optimization Transfer Using Surrogate Objective Functions
Lange, K., Hunter, D. R., & Yang, I. (2000) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2000.10474858 · Cited by 808
Convergence of a stochastic approximation version of the EM algorithm
Delyon, B., Lavielle, M., & Moulines, E. (1999) · The Annals of Statistics · doi:10.1214/aos/1018031103 · Cited by 778
Metadata
- Authors
- LIU, C., & RUBIN, D. B.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 1994
- Volume
- 81
- Issue
- 4
- Pages
- 633-648
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2118254160
- Cited by
- 613
- References
- 26
- FWCI
- 10.19
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.