IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/242567.html
   My bibliography  Save this article

An Expectation Maximization Algorithm to Model Failure Times by Continuous-Time Markov Chains

Author

Listed:
  • Qihong Duan
  • Zhiping Chen
  • Dengfu Zhao

Abstract

In many applications, the failure rate function may present a bathtub shape curve. In this paper, an expectation maximization algorithm is proposed to construct a suitable continuous-time Markov chain which models the failure time data by the first time reaching the absorbing state. Assume that a system is described by methods of supplementary variables, the device of stage, and so on. Given a data set, the maximum likelihood estimators of the initial distribution and the infinitesimal transition rates of the Markov chain can be obtained by our novel algorithm. Suppose that there are transient states in the system and that there are failure time data. The devised algorithm only needs to compute the exponential of upper triangular matrices for times in each iteration. Finally, the algorithm is applied to two real data sets, which indicates the practicality and efficiency of our algorithm.

Suggested Citation

  • Qihong Duan & Zhiping Chen & Dengfu Zhao, 2010. "An Expectation Maximization Algorithm to Model Failure Times by Continuous-Time Markov Chains," Mathematical Problems in Engineering, Hindawi, vol. 2010, pages 1-16, September.
  • Handle: RePEc:hin:jnlmpe:242567
    DOI: 10.1155/2010/242567
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2010/242567.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2010/242567.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2010/242567?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:242567. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.