A Comparative Analysis of Metaheuristic Feature Selection Methods in Software Vulnerability Prediction.

Saved in:
Bibliographic Details
Title: A Comparative Analysis of Metaheuristic Feature Selection Methods in Software Vulnerability Prediction.
Authors: Bassi, Deepali, Singh, Hardeep
Source: e-Informatica; 2025, Vol. 19 Issue 1, p1-44, 44p
Subject Terms: FEATURE selection, COMPUTER security vulnerabilities, MACHINE learning, DIMENSIONAL reduction algorithms, METAHEURISTIC algorithms, COMPUTER performance, FORECASTING, COMPARATIVE studies
Abstract: Background: Early identification of software vulnerabilities is an intrinsic step in achieving software security. In the era of artificial intelligence, software vulnerability prediction models (VPMs) are created using machine learning and deep learning approaches. The effectiveness of these models aids in increasing the quality of the software. The handling of imbalanced datasets and dimensionality reduction are important aspects that affect the performance of VPMs. Aim: The current study applies novel metaheuristic approaches for feature subset selection. Method: This paper performs a comparative analysis of forty-eight combinations of eight machine learning techniques and six metaheuristic feature selection methods on four public datasets. Results: The experimental results reveal that VPMs productivity is upgraded after the application of the feature selection methods for both metrics-based and text-mining-based datasets. Additionally, the study has applied Wilcoxon signed-rank test to the results of metrics-based and text-features-based VPMs to evaluate which outperformed the other. Furthermore, it discovers the best-performing feature selection algorithm based on AUC for each dataset. Finally, this paper has performed better than the benchmark studies in terms of F1-score. Conclusion: The results conclude that GWO has performed satisfactorily for all the datasets. [ABSTRACT FROM AUTHOR]
Copyright of e-Informatica is the property of Oficyna Wydawnicza Politechniki Wroclawskiej and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:Background: Early identification of software vulnerabilities is an intrinsic step in achieving software security. In the era of artificial intelligence, software vulnerability prediction models (VPMs) are created using machine learning and deep learning approaches. The effectiveness of these models aids in increasing the quality of the software. The handling of imbalanced datasets and dimensionality reduction are important aspects that affect the performance of VPMs. Aim: The current study applies novel metaheuristic approaches for feature subset selection. Method: This paper performs a comparative analysis of forty-eight combinations of eight machine learning techniques and six metaheuristic feature selection methods on four public datasets. Results: The experimental results reveal that VPMs productivity is upgraded after the application of the feature selection methods for both metrics-based and text-mining-based datasets. Additionally, the study has applied Wilcoxon signed-rank test to the results of metrics-based and text-features-based VPMs to evaluate which outperformed the other. Furthermore, it discovers the best-performing feature selection algorithm based on AUC for each dataset. Finally, this paper has performed better than the benchmark studies in terms of F1-score. Conclusion: The results conclude that GWO has performed satisfactorily for all the datasets. [ABSTRACT FROM AUTHOR]
ISSN:18977979
DOI:10.37190/e-Inf250103