IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/v16y2025i3d10.1007_s13198-025-02717-4.html
   My bibliography  Save this article

Validating multi-objective search algorithms to predict faulty classes

Author

Listed:
  • Ruchika Malhotra

    (Delhi Technological University)

  • Monika Singh

    (Delhi Technological University)

  • Megha Khanna

    (University of Delhi)

Abstract

A recent multi-objective optimization (MOO) problem in software engineering domain is the prediction of faulty classes in a software. It is essentially a trade-off between two conflicting objectives: (a) minimizing the number of classes to be recommended and (b) maximizing the relevance of Application Program Interface (API) document and the bug description. Evolutionary algorithms (EA) seem to be well suited to solve such MOO problems as they parallelly generate a set of solutions that can balance various constraints by effectively using the crossover operator. This study evaluates the use of two EA namely the Non-dominated Sorting Genetic Algorithm (NSGA II) and the Strength Pareto Evolutionary Algorithm 2 (SPEA 2) to predict faulty classes. The results are empirically validated on six open-source Java projects and indicated the effectiveness of both the investigated EA with average values up to 0.75 and 75% for g-mean and balance performance measures respectively. A further statistical analysis of the results indicates the superiority of the NSGA II algorithm over the SPEA 2 as well as mono-objective algorithms with an improvement of up to 22% in f-measure values.

Suggested Citation

  • Ruchika Malhotra & Monika Singh & Megha Khanna, 2025. "Validating multi-objective search algorithms to predict faulty classes," 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. 16(3), pages 893-913, March.
    • Handle: RePEc:spr:ijsaem:v:16:y:2025:i:3:d:10.1007_s13198-025-02717-4
    DOI: 10.1007/s13198-025-02717-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-025-02717-4
    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/s13198-025-02717-4?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.

    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:ijsaem:v:16:y:2025:i:3:d:10.1007_s13198-025-02717-4. 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: 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.