A many objective based feature selection model for software defect prediction

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Concurrency and Computation-Practice & Experience Pub Date : 2024-06-28 DOI:10.1002/cpe.8153
Qi Mao, Jingbo Zhang, Tianhao Zhao, Xingjuan Cai
{"title":"A many objective based feature selection model for software defect prediction","authors":"Qi Mao,&nbsp;Jingbo Zhang,&nbsp;Tianhao Zhao,&nbsp;Xingjuan Cai","doi":"10.1002/cpe.8153","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Given the escalating magnitude and intricacy of software systems, software measurement data often contains irrelevant and redundant features, resulting in significant resource and storage requirements for software defect prediction (SDP). Feature selection (FS) has a vital impact on the initial data preparation phase of SDP. Nonetheless, existing FS methods suffer from issues such as insignificant dimensionality reduction, low accuracy in classifying chosen optimal feature sets, and neglect of complex interactions and dependencies between defect data and features as well as between features and classes. To tackle the aforementioned problems, this paper proposes a many-objective SDPFS (MOSDPFS) model and the binary many-objective PSO algorithm with adaptive enhanced selection strategy (BMaOPSO-AR2) is proposed within this paper. MOSDPFS selects F1 score, the number of features within subsets, and correlation and redundancy measures based on mutual information (MI) as optimization objectives. BMaOPSO-AR2 constructs a binary version of MaOPSO using transfer functions specifically for binary classification. Adaptive update formulas and the introduction of the R2 indicator are employed to augment the variety and convergence of algorithm. Additionally, performance of MOSDPFS and BMaOPSO-AR2 are tested on the NASA-MDP and PROMISE datasets. Numerical results prove that a proposed model and algorithm effectively reduces feature count while enhancing predictive accuracy and minimizing model complexity.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 19","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8153","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Given the escalating magnitude and intricacy of software systems, software measurement data often contains irrelevant and redundant features, resulting in significant resource and storage requirements for software defect prediction (SDP). Feature selection (FS) has a vital impact on the initial data preparation phase of SDP. Nonetheless, existing FS methods suffer from issues such as insignificant dimensionality reduction, low accuracy in classifying chosen optimal feature sets, and neglect of complex interactions and dependencies between defect data and features as well as between features and classes. To tackle the aforementioned problems, this paper proposes a many-objective SDPFS (MOSDPFS) model and the binary many-objective PSO algorithm with adaptive enhanced selection strategy (BMaOPSO-AR2) is proposed within this paper. MOSDPFS selects F1 score, the number of features within subsets, and correlation and redundancy measures based on mutual information (MI) as optimization objectives. BMaOPSO-AR2 constructs a binary version of MaOPSO using transfer functions specifically for binary classification. Adaptive update formulas and the introduction of the R2 indicator are employed to augment the variety and convergence of algorithm. Additionally, performance of MOSDPFS and BMaOPSO-AR2 are tested on the NASA-MDP and PROMISE datasets. Numerical results prove that a proposed model and algorithm effectively reduces feature count while enhancing predictive accuracy and minimizing model complexity.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于多种目标的软件缺陷预测特征选择模型
摘要由于软件系统的规模和复杂性不断增加,软件测量数据往往包含无关和冗余的特征,导致软件缺陷预测(SDP)需要大量的资源和存储空间。特征选择(FS)对 SDP 的初始数据准备阶段有着至关重要的影响。然而,现有的特征选择方法存在一些问题,如降维效果不明显、对所选最优特征集进行分类的准确率低、忽视缺陷数据与特征之间以及特征与类别之间复杂的交互和依赖关系等。针对上述问题,本文提出了多目标 SDPFS(MOSDPFS)模型,并在此基础上提出了具有自适应增强选择策略的二元多目标 PSO 算法(BMaOPSO-AR2)。MOSDPFS 选择 F1 分数、子集中的特征数量以及基于互信息(MI)的相关性和冗余度作为优化目标。BMaOPSO-AR2 是 MaOPSO 的二进制版本,使用了专门用于二进制分类的传递函数。自适应更新公式和 R2 指标的引入增强了算法的多样性和收敛性。此外,还在 NASA-MDP 和 PROMISE 数据集上测试了 MOSDPFS 和 BMaOPSO-AR2 的性能。数值结果证明,所提出的模型和算法有效地减少了特征数量,同时提高了预测准确性并最大限度地降低了模型的复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of: Parallel and distributed computing; High-performance computing; Computational and data science; Artificial intelligence and machine learning; Big data applications, algorithms, and systems; Network science; Ontologies and semantics; Security and privacy; Cloud/edge/fog computing; Green computing; and Quantum computing.
期刊最新文献
Issue Information Improving QoS in cloud resources scheduling using dynamic clustering algorithm and SM-CDC scheduling model Issue Information Issue Information Camellia oleifera trunks detection and identification based on improved YOLOv7
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1