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

A new boosting-based software reliability growth model

Author

Listed:
  • Lev V. Utkin
  • Frank P. A. Coolen

Abstract

A new software reliability growth model (SRGM) called RBoostSRGM is proposed in this paper. It can be regarded as a modification of the boosting SRGMs through the use of a reduced set of weights to take into account the behavior of the software reliability during the debugging process and to avoid overfitting. The main idea underlying the proposed model is to take into account that training data at the end of the debugging process may be more important than data from the beginning of the process. This is modeled by taking a set of weights which are assigned to the elements of training data, i.e., to the series of times to software failures. The second important idea is that this large set is restricted by the imprecise ε-contaminated model. The obtained RBoostSRGM is a parametric model because it is tuned in accordance with the contamination parameter ε. As a variation to this model, we also consider the use of the Kolmogorov-Smirnov bounds for the restriction of the set of weights. Various numerical experiments with data sets from the literature illustrate the proposed model and compare it with the standard non parametric SRGM and the standard boosting SRGM.

Suggested Citation

  • Lev V. Utkin & Frank P. A. Coolen, 2021. "A new boosting-based software reliability growth model," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 50(24), pages 6167-6194, November.
  • Handle: RePEc:taf:lstaxx:v:50:y:2021:i:24:p:6167-6194
    DOI: 10.1080/03610926.2020.1740736
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2020.1740736?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:50:y:2021:i:24:p:6167-6194. 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.