Abstract

This paper proposes a variant of EM (expectation-maximization) algorithm for Markovian arrival process (MAP) parameter estimation. Especially, we derive the deterministic annealing EM (DAEM) algorithm for MAP parameter estimation. The DAEM algorithm is one of the methods to overcome a local maxima problem associated with the conventional EM algorithm. This paper derives concrete E- and M-step formulas for MAP parameter estimation from inter-arrival time data in the framework of DAEM algorithm. Numerical examples demonstrate the DAEM algorithm for Markov-modulated Poisson process (MMPP), and we show that the DAEM algorithm is superior to the conventional EM algorithm in terms of avoiding the convergence to local maxima.

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 call

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.