Abstract
We show that the ECM algorithm can always be constructed to converge at the same or approximately the same rate as the EM algorithm. The construction is based on the well-known conjugate directions algorithm. This result both suggests ways of speeding up the convergence of ECM and provides a simple way of identifying cases where the simplicity and stability of ECM over EM is attained at effectively no loss in convergence speed. Three examples are given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
