IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v51y2022i19p6792-6817.html
   My bibliography  Save this article

ELS algorithm for estimating open source software reliability with masked data considering both fault detection and correction processes

Author

Listed:
  • Jianfeng Yang
  • Ming Zhao
  • Jing Chen

Abstract

Masked data are the system failure data when the exact cause of the failures might be unknown. That is, the cause of the system failures may be any one of the components. Additionally, to incorporate more information and provide more accurate analysis, modeling software fault detection and correction processes have attracted widespread research attention recently. However, stochastic fault correction time and masked data brings more difficulties in parameter estimation. In this paper, a framework of open source software growth reliability model with masked data considering both fault detection and correction processes is proposed. Furthermore, a novel Expectation Least Squares (ELS) method, an EM-like (Expectation Maximization) algorithm, is used to solve the problem of parameter estimation, because of its mathematical convenience and computational efficiency. It is note that the ELS procedure is easy to use and useful for practical applications, and it just needs more relaxed hidden assumptions. Finally, three data sets from real open source software project are applied to the proposed framework, and the results show that the proposed reliability model is useful and powerful.

Suggested Citation

  • Jianfeng Yang & Ming Zhao & Jing Chen, 2022. "ELS algorithm for estimating open source software reliability with masked data considering both fault detection and correction processes," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 51(19), pages 6792-6817, October.
  • Handle: RePEc:taf:lstaxx:v:51:y:2022:i:19:p:6792-6817
    DOI: 10.1080/03610926.2020.1866610
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1866610
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2020.1866610?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:taf:lstaxx:v:51:y:2022:i:19:p:6792-6817. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.