Software defect prediction(SDP)aims to find a reliable method to predict defects in specific software projects and help software engineers allocate limited resources to release high-quality software products.Software ...Software defect prediction(SDP)aims to find a reliable method to predict defects in specific software projects and help software engineers allocate limited resources to release high-quality software products.Software defect prediction can be effectively performed using traditional features,but there are some redundant or irrelevant features in them(the presence or absence of this feature has little effect on the prediction results).These problems can be solved using feature selection.However,existing feature selection methods have shortcomings such as insignificant dimensionality reduction effect and low classification accuracy of the selected optimal feature subset.In order to reduce the impact of these shortcomings,this paper proposes a new feature selection method Cubic TraverseMa Beluga whale optimization algorithm(CTMBWO)based on the improved Beluga whale optimization algorithm(BWO).The goal of this study is to determine how well the CTMBWO can extract the features that are most important for correctly predicting software defects,improve the accuracy of fault prediction,reduce the number of the selected feature and mitigate the risk of overfitting,thereby achieving more efficient resource utilization and better distribution of test workload.The CTMBWO comprises three main stages:preprocessing the dataset,selecting relevant features,and evaluating the classification performance of the model.The novel feature selection method can effectively improve the performance of SDP.This study performs experiments on two software defect datasets(PROMISE,NASA)and shows the method’s classification performance using four detailed evaluation metrics,Accuracy,F1-score,MCC,AUC and Recall.The results indicate that the approach presented in this paper achieves outstanding classification performance on both datasets and has significant improvement over the baseline models.展开更多
To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial populatio...To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.展开更多
针对蝴蝶优化算法(butterfly optimization algorithm,BOA)易陷入局部最优,且收敛速度慢和寻优精度低等问题,提出了一种趋优变异反向学习的樽海鞘群与蝴蝶混合优化算法(hybrid optimization algorithm for salp swarm and butterfly wit...针对蝴蝶优化算法(butterfly optimization algorithm,BOA)易陷入局部最优,且收敛速度慢和寻优精度低等问题,提出了一种趋优变异反向学习的樽海鞘群与蝴蝶混合优化算法(hybrid optimization algorithm for salp swarm and butterfly with reverse mutation towards optimization learning,OMSSBOA)。引入柯西变异对最优蝴蝶个体进行扰动,避免算法陷入局部最优;将改进的樽海鞘群优化算法(salp swarm algorithm,SSA)嵌入到BOA,平衡算法全局勘探和局部开采的比重,进而提高算法收敛速度;利用趋优变异反向学习策略扩大算法搜索范围并提升解的质量,进而提高算法的寻优精度。将改进算法在10种基准测试函数上进行仿真实验,结果表明,改进算法具有较好的寻优性能和鲁棒性。展开更多
针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。I...针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。IMBO算法通过精英反向学习策略对初始帝王蝶种群进行优化,得到适应度值较优的初始帝王蝶个体,进而能够改善帝王蝶种群的多样性;引入差分进化算法启发的变异操作以及自适应策略对帝王蝶个体的寻优方式进行改进,扩大了算法的搜索空间;引入了高斯-柯西变异算子,自适应调整变异步长,避免算法陷入局部最优。将IMBO应用于ML-DOA,实验表明,与传统的DOA估计算法相比,在不同信源数目、信噪比以及种群数量下,本文提出的算法收敛性能更好,均方根误差更低,运算量更小。展开更多
针对传统粗糙集理论在属性约简中存在计算复杂度高、易陷入局部最优解等问题,结合差分教学优化算法的全局搜索能力和粗糙集在处理不精确和不确定数据方面的优势,提出融合差分教学优化的粗糙集属性约简算法(rough set attribute reductio...针对传统粗糙集理论在属性约简中存在计算复杂度高、易陷入局部最优解等问题,结合差分教学优化算法的全局搜索能力和粗糙集在处理不精确和不确定数据方面的优势,提出融合差分教学优化的粗糙集属性约简算法(rough set attribute reduction algorithm based on differential teaching-learning optimization, AR-DTLBO)。首先,引入自适应教学因子和差分变异策略对教学优化算法进行改进,提高算法的搜索能力和优化性能;其次,通过改进后的教学优化算法“教”和“学”两个阶段对属性约简过程进行优化,降低了数据集的维度和复杂性;最后,在UCI数据库中的8个数据集上将所提算法和其他六种算法进行对比实验。实验结果表明,该算法在约简长度、约简时间、约简率和分类精度上均取得了良好的效果,实现了对数据集的有效约简和优化,能够有效减少冗余信息并提高决策规则的准确性,为决策分析和数据挖掘等领域提供了有效支撑。展开更多
文摘Software defect prediction(SDP)aims to find a reliable method to predict defects in specific software projects and help software engineers allocate limited resources to release high-quality software products.Software defect prediction can be effectively performed using traditional features,but there are some redundant or irrelevant features in them(the presence or absence of this feature has little effect on the prediction results).These problems can be solved using feature selection.However,existing feature selection methods have shortcomings such as insignificant dimensionality reduction effect and low classification accuracy of the selected optimal feature subset.In order to reduce the impact of these shortcomings,this paper proposes a new feature selection method Cubic TraverseMa Beluga whale optimization algorithm(CTMBWO)based on the improved Beluga whale optimization algorithm(BWO).The goal of this study is to determine how well the CTMBWO can extract the features that are most important for correctly predicting software defects,improve the accuracy of fault prediction,reduce the number of the selected feature and mitigate the risk of overfitting,thereby achieving more efficient resource utilization and better distribution of test workload.The CTMBWO comprises three main stages:preprocessing the dataset,selecting relevant features,and evaluating the classification performance of the model.The novel feature selection method can effectively improve the performance of SDP.This study performs experiments on two software defect datasets(PROMISE,NASA)and shows the method’s classification performance using four detailed evaluation metrics,Accuracy,F1-score,MCC,AUC and Recall.The results indicate that the approach presented in this paper achieves outstanding classification performance on both datasets and has significant improvement over the baseline models.
文摘To solve the problem of slow convergence and easy to get into the local optimum of the spider monkey optimization algorithm,this paper presents a new algorithm based on multi-strategy(ISMO).First,the initial population is generated by a refracted opposition-based learning strategy to enhance diversity and ergodicity.Second,this paper introduces a non-linear adaptive dynamic weight factor to improve convergence efficiency.Then,using the crisscross strategy,using the horizontal crossover to enhance the global search and vertical crossover to keep the diversity of the population to avoid being trapped in the local optimum.At last,we adopt a Gauss-Cauchy mutation strategy to improve the stability of the algorithm by mutation of the optimal individuals.Therefore,the application of ISMO is validated by ten benchmark functions and feature selection.It is proved that the proposed method can resolve the problem of feature selection.
文摘针对蝴蝶优化算法(butterfly optimization algorithm,BOA)易陷入局部最优,且收敛速度慢和寻优精度低等问题,提出了一种趋优变异反向学习的樽海鞘群与蝴蝶混合优化算法(hybrid optimization algorithm for salp swarm and butterfly with reverse mutation towards optimization learning,OMSSBOA)。引入柯西变异对最优蝴蝶个体进行扰动,避免算法陷入局部最优;将改进的樽海鞘群优化算法(salp swarm algorithm,SSA)嵌入到BOA,平衡算法全局勘探和局部开采的比重,进而提高算法收敛速度;利用趋优变异反向学习策略扩大算法搜索范围并提升解的质量,进而提高算法的寻优精度。将改进算法在10种基准测试函数上进行仿真实验,结果表明,改进算法具有较好的寻优性能和鲁棒性。
文摘针对传统最大似然波达方向(maximum likelihood direction of arrival,ML-DOA)估计存在计算量大、估计精度差等问题,本文提出一种采用改进帝王蝶优化算法(improved monarch butterfly optimization algorithm,IMBO)的ML-DOA估计方法。IMBO算法通过精英反向学习策略对初始帝王蝶种群进行优化,得到适应度值较优的初始帝王蝶个体,进而能够改善帝王蝶种群的多样性;引入差分进化算法启发的变异操作以及自适应策略对帝王蝶个体的寻优方式进行改进,扩大了算法的搜索空间;引入了高斯-柯西变异算子,自适应调整变异步长,避免算法陷入局部最优。将IMBO应用于ML-DOA,实验表明,与传统的DOA估计算法相比,在不同信源数目、信噪比以及种群数量下,本文提出的算法收敛性能更好,均方根误差更低,运算量更小。
文摘针对传统粗糙集理论在属性约简中存在计算复杂度高、易陷入局部最优解等问题,结合差分教学优化算法的全局搜索能力和粗糙集在处理不精确和不确定数据方面的优势,提出融合差分教学优化的粗糙集属性约简算法(rough set attribute reduction algorithm based on differential teaching-learning optimization, AR-DTLBO)。首先,引入自适应教学因子和差分变异策略对教学优化算法进行改进,提高算法的搜索能力和优化性能;其次,通过改进后的教学优化算法“教”和“学”两个阶段对属性约简过程进行优化,降低了数据集的维度和复杂性;最后,在UCI数据库中的8个数据集上将所提算法和其他六种算法进行对比实验。实验结果表明,该算法在约简长度、约简时间、约简率和分类精度上均取得了良好的效果,实现了对数据集的有效约简和优化,能够有效减少冗余信息并提高决策规则的准确性,为决策分析和数据挖掘等领域提供了有效支撑。
