Please use this identifier to cite or link to this item:
Title: Enhanced binary moth flame optimization as a feature selection algorithm to predict software fault prediction
Authors: Tumar, Iyad 
Hassouneh, Yousef 
Hamza, Turabieh 
Thaher, Thaer 
Keywords: Computer software - Verification;Feature Selection;Adaptive sampling (Statistics);Algorithms;Binary moth flame optimization
Issue Date: 1-Jan-2020
Publisher: IEEE Access
Journal: IEEE Access 
Abstract: Software fault prediction (SFP) is a complex problem that meets developers in the software development life cycle. Collecting data from real software projects, either while the development life cycle or after lunch the product, is not a simple task, and the collected data may suffer from imbalance data distribution problem. In this research, we proposed an Enhanced Binary Moth Flame Optimization (EBMFO) with Adaptive synthetic sampling (ADASYN) to predict software faults. BMFO is employed as a wrapper feature selection, while ADASYN enhances the input dataset and address the imbalanced dataset. Converting MFO algorithm from a continues version to the binary version using transfer functions (TFs) from two different groups (S-shape and V-shape) is investigated in this work and proposed an EBFMFO version. Fifteen real projects data obtained from PROMISE repository are employed in this work. Three different classifiers are used: the k-nearest neighbors (k-NN), Decision Trees (DT), and Linear discriminant analysis (LDA). The reported results demonstrate that the proposed EBMFO enhances the overall performance of classifiers and outperforms the results in the literature and show the importance of TF for feature selection algorithms.
Description: Article published in : IEEE Access, vol. 8, 2020, p. 8041-8055
Appears in Collections:Fulltext Publications

Files in This Item:
File Description SizeFormat
08950456.pdf2.92 MBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Jun 27, 2024


checked on Jun 27, 2024

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.