You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
The TM Algorithm for Maximising a Conditional Likelihood Function
David Edwards and Steffen L. Lauritzen
Vol. 88, No. 4 (Dec., 2001), pp. 961-972
Stable URL: http://www.jstor.org/stable/2673695
Page Count: 12
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
This paper describes an algorithm for maximising a conditional likelihood function when the corresponding unconditional likelihood function is more easily maximised. The algorithm is similar to the EM algorithm but different as the parameters rather than the data are augmented and the conditional rather than the marginal likelihood function is maximised. In exponential families the algorithm takes a particular simple form which is computationally very close to the EM algorithm. The algorithm alternates between a T-step which calculates a tilted version of the unconditional likelihood function and an M-step which maximises it. The algorithm applies to mixed graphical chain models (Lauritzen & Wermuth, 1989) and their generalisations (Edwards, 1990), and was developed with these in mind, but it may have applications beyond these. The algorithm has been implemented in the most recent version of the MIM software (Edwards, 2000), where it was named the ME algorithm. The name has been changed to avoid confusion with the algorithm described by Marschner (2001).
Biometrika © 2001 Biometrika Trust