We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

A new boosting-based software reliability growth model.

Utkin, L.V. and Coolen, F.P.A. (2021) 'A new boosting-based software reliability growth model.', Communications in statistics - theory and methods., 50 (24). pp. 6167-6194.


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.

Item Type:Article
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:This is an Accepted Manuscript of an article published by Taylor & Francis in Communications in statistics - theory and methods on 18 March 2020 available online:
Date accepted:03 March 2020
Date deposited:05 March 2020
Date of first online publication:18 March 2020
Date first made open access:18 March 2021

Save or Share this output

Look up in GoogleScholar