Open Access iconOpen Access



Moth Flame Optimization Based FCNN for Prediction of Bugs in Software

C. Anjali*, Julia Punitha Malar Dhas, J. Amar Pratap Singh

Department of CSE, Noorul Islam Center for Higher Studies, 629180, Tamil Nadu, India

* Corresponding Author: C. Anjali. Email: email

Intelligent Automation & Soft Computing 2023, 36(2), 1241-1256.


The software engineering technique makes it possible to create high-quality software. One of the most significant qualities of good software is that it is devoid of bugs. One of the most time-consuming and costly software procedures is finding and fixing bugs. Although it is impossible to eradicate all bugs, it is feasible to reduce the number of bugs and their negative effects. To broaden the scope of bug prediction techniques and increase software quality, numerous causes of software problems must be identified, and successful bug prediction models must be implemented. This study employs a hybrid of Faster Convolution Neural Network and the Moth Flame Optimization (MFO) algorithm to forecast the number of bugs in software based on the program data itself, such as the line quantity in codes, methods characteristics, and other essential software aspects. Here, the MFO method is used to train the neural network to identify optimal weights. The proposed MFO-FCNN technique is compared with existing methods such as AdaBoost (AB), Random Forest (RF), K-Nearest Neighbour (KNN), K-Means Clustering (KMC), Support Vector Machine (SVM) and Bagging Classifier (BC) are examples of machine learning (ML) techniques. The assessment method revealed that machine learning techniques may be employed successfully and through a high level of accuracy. The obtained data revealed that the proposed strategy outperforms the traditional approach.


Cite This Article

C. Anjali, J. P. M. Dhas and J. Amar Pratap Singh, "Moth flame optimization based fcnn for prediction of bugs in software," Intelligent Automation & Soft Computing, vol. 36, no.2, pp. 1241–1256, 2023.

cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1218


  • 400


  • 1


Share Link