IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v311y2022i1d10.1007_s10479-021-04028-w.html
   My bibliography  Save this article

Multi-phase algorithm design for accurate and efficient model fitting

Author

Listed:
  • Joshua Steakelum

    (University of Massachusetts Dartmouth)

  • Jacob Aubertine

    (University of Massachusetts Dartmouth)

  • Kenan Chen

    (University of Massachusetts Dartmouth)

  • Vidhyashree Nagaraju

    (University of Massachusetts Dartmouth)

  • Lance Fiondella

    (University of Massachusetts Dartmouth)

Abstract

Recent research applies soft computing techniques to fit software reliability growth models. However, runtime performance and the distribution of the distance from an optimal solution over multiple runs must be explicitly considered to justify the practical utility of these approaches, promote comparison, and support reproducible research. This paper presents a meta-optimization framework to design stable and efficient multi-phase algorithms for fitting software reliability growth models. The approach combines initial parameter estimation techniques from statistical algorithms, the global search properties of soft computing, and the rapid convergence of numerical methods. Designs that exhibit the best balance between runtime performance and accuracy are identified. The approach is illustrated through nonhomogeneous Poisson process and covariate software reliability growth models, including a cross-validation step on data sets not used to identify designs. The results indicate the nonhomogeneous Poisson process model considered is too simple to benefit from soft computing because it incurs additional runtime with no increase in accuracy attained. However, a multi-phase design for the covariate software reliability growth model consisting of the bat algorithm followed by a numerical method achieves better performance and converges consistently, compared to a numerical method only. The proposed approach supports higher-dimensional covariate software reliability growth model fitting suitable for implementation in a tool.

Suggested Citation

  • Joshua Steakelum & Jacob Aubertine & Kenan Chen & Vidhyashree Nagaraju & Lance Fiondella, 2022. "Multi-phase algorithm design for accurate and efficient model fitting," Annals of Operations Research, Springer, vol. 311(1), pages 357-379, April.
    • Handle: RePEc:spr:annopr:v:311:y:2022:i:1:d:10.1007_s10479-021-04028-w
    DOI: 10.1007/s10479-021-04028-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-021-04028-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-021-04028-w?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.

    References listed on IDEAS

    as
    1. Ankur Choudhary & Anurag Singh Baghel & Om Prakash Sangwan, 2017. "An efficient parameter estimation of software reliability growth models using gravitational search algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(1), pages 79-88, March.
    2. Ramakanta Mohanty & Vadlamani Ravi & Manas Ranjan Patra, 2010. "The application of intelligent and soft-computing techniques to software engineering problems: a review," International Journal of Information and Decision Sciences, Inderscience Enterprises Ltd, vol. 2(3), pages 233-272.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      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:spr:annopr:v:311:y:2022:i:1:d:10.1007_s10479-021-04028-w. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.