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.展开更多
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.展开更多
进化规划中,个体选择变异策略特别重要.适应性变异策略因在进化过程中动态选择个体变异策略,能够取得较好的性能.传统适应性变异策略都依据个体一步进化效果考察个体适应性,没有从多步进化效果上对变异策略进行评价.本文提出一种新的基...进化规划中,个体选择变异策略特别重要.适应性变异策略因在进化过程中动态选择个体变异策略,能够取得较好的性能.传统适应性变异策略都依据个体一步进化效果考察个体适应性,没有从多步进化效果上对变异策略进行评价.本文提出一种新的基于Q学习的适应性进化规划算法QEP(Q learning based evolutionary programming),该算法将变异策略看成行动,考察个体多步进化效果,并通过计算Q函数值,学习个体最优变异策略.实验表明,QEP能够获得好的性能.展开更多
光伏阵列输出在不同工况下具有单峰或多峰特性.针对因最大功率点跟踪(maximum power point tracking,简称MPPT)精度不高、跟踪时间较长而导致光伏发电效率低下的问题,提出一种改进的量子粒子群优化(quantum particle swarm optimization...光伏阵列输出在不同工况下具有单峰或多峰特性.针对因最大功率点跟踪(maximum power point tracking,简称MPPT)精度不高、跟踪时间较长而导致光伏发电效率低下的问题,提出一种改进的量子粒子群优化(quantum particle swarm optimization,简称QPSO)算法.采用Logistic混沌映射初始化粒子种群;在种群进化前期将反向学习策略引入惯性权重自适应调整的量子粒子群优化(dynamically changing weights quantum-behaved particle swarm optimization,简称DCWQPSO),扩大种群搜索范围,提高种群的全局搜索能力;在种群进化后期将模拟退火机制引入DCWQPSO,提高种群收敛速度,并对粒子群进行柯西变异,增强粒子的多样性,提升局部搜索能力.Matlab仿真结果表明:相对其他4种算法,该文提出的改进QPSO算法的跟踪时间更短、跟踪精度更高.因此,该文算法具有优越性.展开更多
文摘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.
文摘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.
文摘进化规划中,个体选择变异策略特别重要.适应性变异策略因在进化过程中动态选择个体变异策略,能够取得较好的性能.传统适应性变异策略都依据个体一步进化效果考察个体适应性,没有从多步进化效果上对变异策略进行评价.本文提出一种新的基于Q学习的适应性进化规划算法QEP(Q learning based evolutionary programming),该算法将变异策略看成行动,考察个体多步进化效果,并通过计算Q函数值,学习个体最优变异策略.实验表明,QEP能够获得好的性能.
