Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convol...Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.展开更多
In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature sel...In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature selection aims to alleviate this issue by minimizing the number of features in the subset while simultaneously minimizing the classification error rate.Single-objective optimization approaches employ an evaluation function designed as an aggregate function with a parameter,but the results obtained depend on the value of the parameter.To eliminate this parameter’s influence,the problem can be reformulated as a multi-objective optimization problem.The Whale Optimization Algorithm(WOA)is widely used in optimization problems because of its simplicity and easy implementation.In this paper,we propose a multi-strategy assisted multi-objective WOA(MSMOWOA)to address feature selection.To enhance the algorithm’s search ability,we integrate multiple strategies such as Levy flight,Grey Wolf Optimizer,and adaptive mutation into it.Additionally,we utilize an external repository to store non-dominant solution sets and grid technology is used to maintain diversity.Results on fourteen University of California Irvine(UCI)datasets demonstrate that our proposed method effectively removes redundant features and improves classification performance.The source code can be accessed from the website:https://github.com/zc0315/MSMOWOA.展开更多
In this paper,a multi-strategy improved coati optimization algorithm(MICOA)for engineering applications is proposed to improve the performance of the coati optimization algorithm(COA)in terms of convergence speed and ...In this paper,a multi-strategy improved coati optimization algorithm(MICOA)for engineering applications is proposed to improve the performance of the coati optimization algorithm(COA)in terms of convergence speed and convergence accuracy.First,a chaotic mapping is applied to initial-ize the population in order to improve the quality of the population and thus the convergence speed of the algorithm.Second,the prey’s position is improved during the prey-hunting phase.Then,the COA is combined with the particle swarm optimization(PSO)and the golden sine algorithm(Gold-SA),and the position is updated with probabilities to avoid local extremes.Finally,a population decreasing strategy is applied as a way to improve the performance of the algorithm in a comprehen-sive approach.The paper compares the proposed algorithm MICOA with 7 well-known meta-heuristic optimization algorithms and evaluates the algorithm in 23 test functions as well as engineering appli-cation.Experimental results show that the MICOA proposed in this paper has good effectiveness and superiority,and has a strong competitiveness compared with the comparison algorithms.展开更多
Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the p...Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.展开更多
The power optimization of mixed polarity Reed–Muller(MPRM)logic circuits is a classic combinatorial optimization problem.Existing optimization approaches often suffer from slow convergence and a propensity to converg...The power optimization of mixed polarity Reed–Muller(MPRM)logic circuits is a classic combinatorial optimization problem.Existing optimization approaches often suffer from slow convergence and a propensity to converge to local optima,limiting their effectiveness in achieving optimal power efficiency.First,we propose a novel multi-strategy fusion memetic algorithm(MFMA).MFMA integrates global exploration via the chimp optimization algorithm with local exploration using the coati optimization algorithm based on the optimal position learning and adaptive weight factor(COA-OLA),complemented by population management through truncation selection.Second,leveraging MFMA,we propose a power optimization approach for MPRM logic circuits that searches for the best polarity configuration to minimize circuit power.Experimental results based on Microelectronics Center of North Carolina(MCNC)benchmark circuits demonstrate significant improvements over existing power optimization approaches.MFMA achieves a maximum power saving rate of 72.30%and an average optimization rate of 43.37%;it searches for solutions faster and with higher quality,validating its effectiveness and superiority in power optimization.展开更多
基金supported by Science and Technology Innovation Programfor Postgraduate Students in IDP Subsidized by Fundamental Research Funds for the Central Universities(Project No.ZY20240335)support of the Research Project of the Key Technology of Malicious Code Detection Based on Data Mining in APT Attack(Project No.2022IT173)the Research Project of the Big Data Sensitive Information Supervision Technology Based on Convolutional Neural Network(Project No.2022011033).
文摘Previous studies have shown that deep learning is very effective in detecting known attacks.However,when facing unknown attacks,models such as Deep Neural Networks(DNN)combined with Long Short-Term Memory(LSTM),Convolutional Neural Networks(CNN)combined with LSTM,and so on are built by simple stacking,which has the problems of feature loss,low efficiency,and low accuracy.Therefore,this paper proposes an autonomous detectionmodel for Distributed Denial of Service attacks,Multi-Scale Convolutional Neural Network-Bidirectional Gated Recurrent Units-Single Headed Attention(MSCNN-BiGRU-SHA),which is based on a Multistrategy Integrated Zebra Optimization Algorithm(MI-ZOA).The model undergoes training and testing with the CICDDoS2019 dataset,and its performance is evaluated on a new GINKS2023 dataset.The hyperparameters for Conv_filter and GRU_unit are optimized using the Multi-strategy Integrated Zebra Optimization Algorithm(MIZOA).The experimental results show that the test accuracy of the MSCNN-BiGRU-SHA model based on the MIZOA proposed in this paper is as high as 0.9971 in the CICDDoS 2019 dataset.The evaluation accuracy of the new dataset GINKS2023 created in this paper is 0.9386.Compared to the MSCNN-BiGRU-SHA model based on the Zebra Optimization Algorithm(ZOA),the detection accuracy on the GINKS2023 dataset has improved by 5.81%,precisionhas increasedby 1.35%,the recallhas improvedby 9%,and theF1scorehas increasedby 5.55%.Compared to the MSCNN-BiGRU-SHA models developed using Grid Search,Random Search,and Bayesian Optimization,the MSCNN-BiGRU-SHA model optimized with the MI-ZOA exhibits better performance in terms of accuracy,precision,recall,and F1 score.
基金supported in part by the Natural Science Youth Foundation of Hebei Province under Grant F2019403207in part by the PhD Research Startup Foundation of Hebei GEO University under Grant BQ2019055+3 种基金in part by the Open Research Project of the Hubei Key Laboratory of Intelligent Geo-Information Processing under Grant KLIGIP-2021A06in part by the Fundamental Research Funds for the Universities in Hebei Province under Grant QN202220in part by the Science and Technology Research Project for Universities of Hebei under Grant ZD2020344in part by the Guangxi Natural Science Fund General Project under Grant 2021GXNSFAA075029.
文摘In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature selection aims to alleviate this issue by minimizing the number of features in the subset while simultaneously minimizing the classification error rate.Single-objective optimization approaches employ an evaluation function designed as an aggregate function with a parameter,but the results obtained depend on the value of the parameter.To eliminate this parameter’s influence,the problem can be reformulated as a multi-objective optimization problem.The Whale Optimization Algorithm(WOA)is widely used in optimization problems because of its simplicity and easy implementation.In this paper,we propose a multi-strategy assisted multi-objective WOA(MSMOWOA)to address feature selection.To enhance the algorithm’s search ability,we integrate multiple strategies such as Levy flight,Grey Wolf Optimizer,and adaptive mutation into it.Additionally,we utilize an external repository to store non-dominant solution sets and grid technology is used to maintain diversity.Results on fourteen University of California Irvine(UCI)datasets demonstrate that our proposed method effectively removes redundant features and improves classification performance.The source code can be accessed from the website:https://github.com/zc0315/MSMOWOA.
基金Supported by the National Key R&D Program of China(2022ZD0119001).
文摘In this paper,a multi-strategy improved coati optimization algorithm(MICOA)for engineering applications is proposed to improve the performance of the coati optimization algorithm(COA)in terms of convergence speed and convergence accuracy.First,a chaotic mapping is applied to initial-ize the population in order to improve the quality of the population and thus the convergence speed of the algorithm.Second,the prey’s position is improved during the prey-hunting phase.Then,the COA is combined with the particle swarm optimization(PSO)and the golden sine algorithm(Gold-SA),and the position is updated with probabilities to avoid local extremes.Finally,a population decreasing strategy is applied as a way to improve the performance of the algorithm in a comprehen-sive approach.The paper compares the proposed algorithm MICOA with 7 well-known meta-heuristic optimization algorithms and evaluates the algorithm in 23 test functions as well as engineering appli-cation.Experimental results show that the MICOA proposed in this paper has good effectiveness and superiority,and has a strong competitiveness compared with the comparison algorithms.
基金supported by the Natural Science Foundation of Hunan Province of China(Nos.2021JJ10045 and 2025JJ60072)the Open Research Subject of State Key Laboratory of Intelligent Game(No.ZBKF-24-01)+1 种基金the Postdoctoral Fellowship Program of CPSF(No.GZB20240989)the China Postdoctoral Science Foundation(No.2024M754304).
文摘Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.
基金Project supported by the National Natural Science Foundation of China(No.62102130)Central Government Guides Local Science and Technology Development Fund Project+4 种基金China(No.226Z0201G)Natural Science Foundation of Hebei ProvinceChina(Nos.F2020204003 and F2024204001)Science and Technology Research Projects of Higher Education Institutions in Hebei ProvinceChina(No.QN2024138)。
文摘The power optimization of mixed polarity Reed–Muller(MPRM)logic circuits is a classic combinatorial optimization problem.Existing optimization approaches often suffer from slow convergence and a propensity to converge to local optima,limiting their effectiveness in achieving optimal power efficiency.First,we propose a novel multi-strategy fusion memetic algorithm(MFMA).MFMA integrates global exploration via the chimp optimization algorithm with local exploration using the coati optimization algorithm based on the optimal position learning and adaptive weight factor(COA-OLA),complemented by population management through truncation selection.Second,leveraging MFMA,we propose a power optimization approach for MPRM logic circuits that searches for the best polarity configuration to minimize circuit power.Experimental results based on Microelectronics Center of North Carolina(MCNC)benchmark circuits demonstrate significant improvements over existing power optimization approaches.MFMA achieves a maximum power saving rate of 72.30%and an average optimization rate of 43.37%;it searches for solutions faster and with higher quality,validating its effectiveness and superiority in power optimization.
