Abstract
This paper proposes an improved expectation–maximization (EM) algorithm for phase‐type (PH) distributions with grouped and truncated data. Olsson (1996) derived an EM algorithm for PH distributions under censored data, and the similar technique can be utilized to the PH fitting even under grouped and truncated data. However, it should be noted that Olsson's algorithm has a drawback in terms of computation speed. Because the time complexity of the algorithm is a cube of number of phases, it does not work well in the case where the number of phases is large. This paper proposes an improvement of the EM algorithm under grouped and truncated observations. By applying a uniformization‐based technique for continuous‐time Markov chains, it is shown that the time complexity of our algorithm can be reduced to the square of number of phases. In particular, when we consider the PH fitting using a canonical form of PH distributions, the time complexity is linear in the number of phases. Copyright © 2012 John Wiley & Sons, Ltd.
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 callMore From: Applied Stochastic Models in Business and Industry
Disclaimer: 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.
