Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search an...Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.展开更多
In recent years,feature selection(FS)optimization of high-dimensional gene expression data has become one of the most promising approaches for cancer prediction and classification.This work reviews FS and classificati...In recent years,feature selection(FS)optimization of high-dimensional gene expression data has become one of the most promising approaches for cancer prediction and classification.This work reviews FS and classification methods that utilize evolutionary algorithms(EAs)for gene expression profiles in cancer or medical applications based on research motivations,challenges,and recommendations.Relevant studies were retrieved from four major academic databases-IEEE,Scopus,Springer,and ScienceDirect-using the keywords‘cancer classification’,‘optimization’,‘FS’,and‘gene expression profile’.A total of 67 papers were finally selected with key advancements identified as follows:(1)The majority of papers(44.8%)focused on developing algorithms and models for FS and classification.(2)The second category encompassed studies on biomarker identification by EAs,including 20 papers(30%).(3)The third category comprised works that applied FS to cancer data for decision support system purposes,addressing high-dimensional data and the formulation of chromosome length.These studies accounted for 12%of the total number of studies.(4)The remaining three papers(4.5%)were reviews and surveys focusing on models and developments in prediction and classification optimization for cancer classification under current technical conditions.This review highlights the importance of optimizing FS in EAs to manage high-dimensional data effectively.Despite recent advancements,significant limitations remain:the dynamic formulation of chromosome length remains an underexplored area.Thus,further research is needed on dynamic-length chromosome techniques for more sophisticated biomarker gene selection techniques.The findings suggest that further advancements in dynamic chromosome length formulations and adaptive algorithms could enhance cancer classification accuracy and efficiency.展开更多
A novel method based on the selective pressure of particle size （particle-size cultivation method, PSCM） was developed for the cultivation and operation of aerobic granular sludge in a continuous-flow reactor, and c...A novel method based on the selective pressure of particle size （particle-size cultivation method, PSCM） was developed for the cultivation and operation of aerobic granular sludge in a continuous-flow reactor, and compared with the conventional method based on the selective pressure of settling velocity （settling-velocity cultivation method, SVCM）. Results indicated that aerobic granules could be cultivated in continuous operation mode by this developed method within 14 days. Although in the granulation process, under particle-size selective pressure, mixed liquor suspended solids （MLSS） in the reactor fluctuated greatly and filamentous bacteria dominated the sludge system during the initial operation days, no obvious difference in profile was found between the aerobic granules cultivated by PSCM and SVCM. Moreover, aerobic granules cultivated by PSCM presented larger diameter, lower water content and higher specific rates of nitrification, denitrifieation and phosphorus removal, but lower settling velocity. Under long term operation of more than 30 days, aerobic granules in the continuous-flow reactor could remain stable and obtain good chemical oxygen demand （COD）, NH4^＋-N, total nitrogen （TN） and total phosphorus （TP） removal. The results indicate that PSCM was dependent on the cultivation and maintenance of the stability of aerobic granules in continuous-flow bioreactors.展开更多
In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update ...In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.展开更多
Feature selection is one of the important topics in text classification. However, most of existing feature selection methods are serial and inefficient to be applied to massive text data sets. In this case, a feature ...Feature selection is one of the important topics in text classification. However, most of existing feature selection methods are serial and inefficient to be applied to massive text data sets. In this case, a feature selection method based on parallel collaborative evolutionary genetic algorithm is presented. The presented method uses genetic algorithm to select feature subsets and takes advantage of parallel collaborative evolution to enhance time efficiency, so it can quickly acquire the feature subsets which are more representative. The experimental results show that, for accuracy ratio and recall ratio, the presented method is better than information gain, x2 statistics, and mutual information methods; the consumed time of the presented method with only one CPU is inferior to that of these three methods, but the presented method is supe rior after using the parallel strategy.展开更多
In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization(GWO)with Harris Hawks Optimization(HHO)for feature selec...In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization(GWO)with Harris Hawks Optimization(HHO)for feature selection.Themotivation for utilizingGWOandHHOstems fromtheir bio-inspired nature and their demonstrated success in optimization problems.We aimto leverage the strengths of these algorithms to enhance the effectiveness of feature selection in microarray-based cancer classification.We selected leave-one-out cross-validation(LOOCV)to evaluate the performance of both two widely used classifiers,k-nearest neighbors(KNN)and support vector machine(SVM),on high-dimensional cancer microarray data.The proposed method is extensively tested on six publicly available cancer microarray datasets,and a comprehensive comparison with recently published methods is conducted.Our hybrid algorithm demonstrates its effectiveness in improving classification performance,Surpassing alternative approaches in terms of precision.The outcomes confirm the capability of our method to substantially improve both the precision and efficiency of cancer classification,thereby advancing the development ofmore efficient treatment strategies.The proposed hybridmethod offers a promising solution to the gene selection problem in microarray-based cancer classification.It improves the accuracy and efficiency of cancer diagnosis and treatment,and its superior performance compared to other methods highlights its potential applicability in realworld cancer classification tasks.By harnessing the complementary search mechanisms of GWO and HHO,we leverage their bio-inspired behavior to identify informative genes relevant to cancer diagnosis and treatment.展开更多
In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical j...In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical job shop-schedule problem is adopted and three types of special aircraft-taxi conflicts are considered in the constraints. To solve such nondeterministic polynomial time-complex problems, the immune clonal selection algorithm（ICSA） is introduced. The simulation results in a congested hour of Beijing Capital International Airport show that, compared with the first-come-first-served（FCFS） strategy, the optimization-planning strategy reduces the total scheduling time by 13.6 min and the taxiing time per aircraft by 45.3 s, which improves the capacity of the runway and the efficiency of airport operations.展开更多
Planetary gear train is a prominent component of helicopter transmission system and its health is of great significance for the flight safety of the helicopter.During health condition monitoring,the selection of a fau...Planetary gear train is a prominent component of helicopter transmission system and its health is of great significance for the flight safety of the helicopter.During health condition monitoring,the selection of a fault sensitive feature subset is meaningful for fault diagnosis of helicopter planetary gear train.According to actual situation,this paper proposed a multi-criteria fusion feature selection algorithm (MCFFSA) to identify an optimal feature subset from the highdimensional original feature space.In MCFFSA,a fault feature set of multiple domains,including time domain,frequency domain and wavelet domain,is first extracted from the raw vibration dataset.Four targeted criteria are then fused by multi-objective evolutionary algorithm based on decomposition (MOEA/D) to find Proto-efficient subsets,wherein two criteria for measuring diagnostic performance are assessed by sparse Bayesian extreme learning machine (SBELM).Further,Fmeasure is adopted to identify the optimal feature subset,which was employed for subsequent fault diagnosis.The effectiveness of MCFFSA is validated through six fault recognition datasets from a real helicopter transmission platform.The experimental results illustrate the superiority of combination of MOEA/D and SBELM in MCFFSA,and comparative analysis demonstrates that the optimal feature subset provided by MCFFSA can achieve a better diagnosis performance than other algorithms.展开更多
A dandelion algorithm(DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA,which might not be appropriate for all...A dandelion algorithm(DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA,which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA's parameters and simplify DA's structure. Only the normal sowing operator is retained;while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection(CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.展开更多
Solving constrained multi-objective optimization problems with evolutionary algorithms has attracted considerable attention.Various constrained multi-objective optimization evolutionary algorithms(CMOEAs)have been dev...Solving constrained multi-objective optimization problems with evolutionary algorithms has attracted considerable attention.Various constrained multi-objective optimization evolutionary algorithms(CMOEAs)have been developed with the use of different algorithmic strategies,evolutionary operators,and constraint-handling techniques.The performance of CMOEAs may be heavily dependent on the operators used,however,it is usually difficult to select suitable operators for the problem at hand.Hence,improving operator selection is promising and necessary for CMOEAs.This work proposes an online operator selection framework assisted by Deep Reinforcement Learning.The dynamics of the population,including convergence,diversity,and feasibility,are regarded as the state;the candidate operators are considered as actions;and the improvement of the population state is treated as the reward.By using a Q-network to learn a policy to estimate the Q-values of all actions,the proposed approach can adaptively select an operator that maximizes the improvement of the population according to the current state and thereby improve the algorithmic performance.The framework is embedded into four popular CMOEAs and assessed on 42 benchmark problems.The experimental results reveal that the proposed Deep Reinforcement Learning-assisted operator selection significantly improves the performance of these CMOEAs and the resulting algorithm obtains better versatility compared to nine state-of-the-art CMOEAs.展开更多
One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection...One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection of features has an essential importance in the classification process to be able minimize computational time,which decreases data size and increases the precision and effectiveness of specific machine learning activities.Due to its superiority to conventional optimization methods,several metaheuristics have been used to resolve FS issues.This is why hybrid metaheuristics help increase the search and convergence rate of the critical algorithms.A modern hybrid selection algorithm combining the two algorithms;the genetic algorithm(GA)and the Particle Swarm Optimization(PSO)to enhance search capabilities is developed in this paper.The efficacy of our proposed method is illustrated in a series of simulation phases,using the UCI learning array as a benchmark dataset.展开更多
Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review exp...Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review explores the historical development of MOEAs,beginning with foundational concepts in multi-objective optimization,basic types of MOEAs,and the evolution of Pareto-based selection and niching methods.Further advancements,including decom-position-based approaches and hybrid algorithms,are discussed.Applications are analyzed in established domains such as engineering and economics,as well as in emerging fields like advanced analytics and machine learning.The significance of MOEAs in addressing real-world problems is emphasized,highlighting their role in facilitating informed decision-making.Finally,the development trajectory of MOEAs is compared with evolutionary processes,offering insights into their progress and future potential.展开更多
There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model called the abstract evolutionary algorithm （AEA）, which uni...There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model called the abstract evolutionary algorithm （AEA）, which unifies most of the currently known evolutionary algorithms and describes the evolution as an abstract stochastic process composed of two fundamental abstract operators： abstract selection and evolution operators. In this paper, we first introduce the definitions of the generalized abstract selection and evolution operators. Then we discuss the characterization of some parameters related to generalized abstract selection and evolution operators. Based on these operators, we finally give the strong convergence of the generalized abstract evolutionary algorithm. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.展开更多
<strong>Objective</strong>: This paper aims to explore clinical status and related influence factors of pressure injury (PI) in the elderly inpatients with kidney disease, so as to provide reference for th...<strong>Objective</strong>: This paper aims to explore clinical status and related influence factors of pressure injury (PI) in the elderly inpatients with kidney disease, so as to provide reference for the prevention and treatment of PI in the elderly inpatients with kidney disease. <strong>Methods</strong>: Retrospective collection method is adopted to collect 158 clinical cases of the elderly inpatients with kidney disease aged ≥ 60 in the Nephrology Department, the First Affiliated Hospital of Jinan University from January 2017 to December 2019, and then least absolute shrinkage and selection Operator (LASSO) regression analysis is used to analyze 17 possible influence factors;finally Logistic regression model is established to analyze and screen influence factors of risk. <strong>Results</strong>: 1) Among 158 elderly inpatients with medium and high risk of PI, the incidence of PI is 20.25%;the most common stage of injury is stage I (42.5%);sacrococcygeal (60%) is the high-risk site of pressure injury. 2) LASSO regression analysis shows that history of present respiratory infection/respiratory failure (<em>β </em>= 1.2714. <em>P</em> < 0.05) and hospitalization time (<em>β</em> = 0.4177. <em>P </em>< 0.05) are independent factors influencing PI risk in the elderly inpatients with kidney disease. <strong>Concl</strong><strong>usio</strong><strong>n</strong>: The elderly patients with kidney disease and PI risk are the high incidence population of hospital acquired PI;for the elderly inpatients with kidney disease and having respiratory infection history or respiratory failure, prolonged hospitalization will significantly increase the risk of PI. Therefore, targeted preventive and control measures should be taken to reduce the incidence of PI.展开更多
In this work, focusing on the demerit of AEA (Alopex-based evolutionary algorithm) algorithm, an improved AEA algorithm (AEA-C) which was fused AEA with clonal selection algorithm was proposed. Considering the irratio...In this work, focusing on the demerit of AEA (Alopex-based evolutionary algorithm) algorithm, an improved AEA algorithm (AEA-C) which was fused AEA with clonal selection algorithm was proposed. Considering the irrationality of the method that generated candidate solutions at each iteration of AEA, clonal selection algorithm could be applied to improve the method. The performance of the proposed new algorithm was studied by using 22 benchmark functions and was compared with original AEA given the same conditions. The experimental results show that the AEA-C clearly outperforms the original AEA for almost all the 22 benchmark functions with 10, 30, 50 dimensions in success rates, solution quality and stability. Furthermore, AEA-C was applied to estimate 6 kinetics parameters of the fermentation dynamics models. The standard deviation of the objective function calculated by the AEA-C is 41.46 and is far less than that of other literatures' results, and the fitting curves obtained by AEA-C are more in line with the actual fermentation process curves.展开更多
This paper discusses the convergence rates about a class of evolutionary algorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra.Under certain condition...This paper discusses the convergence rates about a class of evolutionary algorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra.Under certain conditions that transition probability functions of Markov chains corresponding to evolutionary algorithms satisfy,the authors obtain the convergence rates of the exponential order.Furthermore,they also analyze the characteristics of the conditions which can be met by genetic operators and selection strategies.展开更多
BACKGROUND Difficulty of colonoscopy insertion(DCI)significantly affects colonoscopy effectiveness and serves as a key quality indicator.Predicting and evaluating DCI risk preoperatively is crucial for optimizing intr...BACKGROUND Difficulty of colonoscopy insertion(DCI)significantly affects colonoscopy effectiveness and serves as a key quality indicator.Predicting and evaluating DCI risk preoperatively is crucial for optimizing intraoperative strategies.AIM To evaluate the predictive performance of machine learning(ML)algorithms for DCI by comparing three modeling approaches,identify factors influencing DCI,and develop a preoperative prediction model using ML algorithms to enhance colonoscopy quality and efficiency.METHODS This cross-sectional study enrolled 712 patients who underwent colonoscopy at a tertiary hospital between June 2020 and May 2021.Demographic data,past medical history,medication use,and psychological status were collected.The endoscopist assessed DCI using the visual analogue scale.After univariate screening,predictive models were developed using multivariable logistic regression,least absolute shrinkage and selection operator(LASSO)regression,and random forest(RF)algorithms.Model performance was evaluated based on discrimination,calibration,and decision curve analysis(DCA),and results were visualized using nomograms.RESULTS A total of 712 patients(53.8%male;mean age 54.5 years±12.9 years)were included.Logistic regression analysis identified constipation[odds ratio(OR)=2.254,95%confidence interval(CI):1.289-3.931],abdominal circumference(AC)(77.5–91.9 cm,OR=1.895,95%CI:1.065-3.350;AC≥92 cm,OR=1.271,95%CI:0.730-2.188),and anxiety(OR=1.071,95%CI:1.044-1.100)as predictive factors for DCI,validated by LASSO and RF methods.Model performance revealed training/validation sensitivities of 0.826/0.925,0.924/0.868,and 1.000/0.981;specificities of 0.602/0.511,0.510/0.562,and 0.977/0.526;and corresponding area under the receiver operating characteristic curves(AUCs)of 0.780(0.737-0.823)/0.726(0.654-0.799),0.754(0.710-0.798)/0.723(0.656-0.791),and 1.000(1.000-1.000)/0.754(0.688-0.820),respectively.DCA indicated optimal net benefit within probability thresholds of 0-0.9 and 0.05-0.37.The RF model demonstrated superior diagnostic accuracy,reflected by perfect training sensitivity(1.000)and highest validation AUC(0.754),outperforming other methods in clinical applicability.CONCLUSION The RF-based model exhibited superior predictive accuracy for DCI compared to multivariable logistic and LASSO regression models.This approach supports individualized preoperative optimization,enhancing colonoscopy quality through targeted risk stratification.展开更多
基金Supported by the National Natural Science Foundation of China(60133010,70071042,60073043)
文摘Multi-objective Evolutionary Algorithm (MOEA) is becoming a hot research area and quite a few aspects of MOEAs have been studied and discussed. However there are still few literatures discussing the roles of search and selection operators in MOEAs. This paper studied their roles by solving a case of discrete Multi-objective Optimization Problem (MOP): Multi-objective TSP with a new MOEA. In the new MOEA, We adopt an efficient search operator, which has the properties of both crossover and mutation, to generate the new individuals and chose two selection operators: Family Competition and Population Competition with probabilities to realize selection. The simulation experiments showed that this new MOEA could get good uniform solutions representing the Pareto Front and outperformed SPEA in almost every simulation run on this problem. Furthermore, we analyzed its convergence property using finite Markov chain and proved that it could converge to Pareto Front with probability 1. We also find that the convergence property of MOEAs has much relationship with search and selection operators.
基金funded by the Ministry of Higher Education of Malaysia,grant number FRGS/1/2022/ICT02/UPSI/02/1.
文摘In recent years,feature selection(FS)optimization of high-dimensional gene expression data has become one of the most promising approaches for cancer prediction and classification.This work reviews FS and classification methods that utilize evolutionary algorithms(EAs)for gene expression profiles in cancer or medical applications based on research motivations,challenges,and recommendations.Relevant studies were retrieved from four major academic databases-IEEE,Scopus,Springer,and ScienceDirect-using the keywords‘cancer classification’,‘optimization’,‘FS’,and‘gene expression profile’.A total of 67 papers were finally selected with key advancements identified as follows:(1)The majority of papers(44.8%)focused on developing algorithms and models for FS and classification.(2)The second category encompassed studies on biomarker identification by EAs,including 20 papers(30%).(3)The third category comprised works that applied FS to cancer data for decision support system purposes,addressing high-dimensional data and the formulation of chromosome length.These studies accounted for 12%of the total number of studies.(4)The remaining three papers(4.5%)were reviews and surveys focusing on models and developments in prediction and classification optimization for cancer classification under current technical conditions.This review highlights the importance of optimizing FS in EAs to manage high-dimensional data effectively.Despite recent advancements,significant limitations remain:the dynamic formulation of chromosome length remains an underexplored area.Thus,further research is needed on dynamic-length chromosome techniques for more sophisticated biomarker gene selection techniques.The findings suggest that further advancements in dynamic chromosome length formulations and adaptive algorithms could enhance cancer classification accuracy and efficiency.
基金supported by the National Natural Science Foundation of China (No. 51208231)
文摘A novel method based on the selective pressure of particle size （particle-size cultivation method, PSCM） was developed for the cultivation and operation of aerobic granular sludge in a continuous-flow reactor, and compared with the conventional method based on the selective pressure of settling velocity （settling-velocity cultivation method, SVCM）. Results indicated that aerobic granules could be cultivated in continuous operation mode by this developed method within 14 days. Although in the granulation process, under particle-size selective pressure, mixed liquor suspended solids （MLSS） in the reactor fluctuated greatly and filamentous bacteria dominated the sludge system during the initial operation days, no obvious difference in profile was found between the aerobic granules cultivated by PSCM and SVCM. Moreover, aerobic granules cultivated by PSCM presented larger diameter, lower water content and higher specific rates of nitrification, denitrifieation and phosphorus removal, but lower settling velocity. Under long term operation of more than 30 days, aerobic granules in the continuous-flow reactor could remain stable and obtain good chemical oxygen demand （COD）, NH4^＋-N, total nitrogen （TN） and total phosphorus （TP） removal. The results indicate that PSCM was dependent on the cultivation and maintenance of the stability of aerobic granules in continuous-flow bioreactors.
文摘In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.
基金supported by the Science and Technology Plan Projects of Sichuan Province of China under Grant No.2008GZ0003the Key Technologies R & D Program of Sichuan Province of China under Grant No.2008SZ0100
文摘Feature selection is one of the important topics in text classification. However, most of existing feature selection methods are serial and inefficient to be applied to massive text data sets. In this case, a feature selection method based on parallel collaborative evolutionary genetic algorithm is presented. The presented method uses genetic algorithm to select feature subsets and takes advantage of parallel collaborative evolution to enhance time efficiency, so it can quickly acquire the feature subsets which are more representative. The experimental results show that, for accuracy ratio and recall ratio, the presented method is better than information gain, x2 statistics, and mutual information methods; the consumed time of the presented method with only one CPU is inferior to that of these three methods, but the presented method is supe rior after using the parallel strategy.
基金the Deputyship for Research and Innovation,“Ministry of Education”in Saudi Arabia for funding this research(IFKSUOR3-014-3).
文摘In this study,our aim is to address the problem of gene selection by proposing a hybrid bio-inspired evolutionary algorithm that combines Grey Wolf Optimization(GWO)with Harris Hawks Optimization(HHO)for feature selection.Themotivation for utilizingGWOandHHOstems fromtheir bio-inspired nature and their demonstrated success in optimization problems.We aimto leverage the strengths of these algorithms to enhance the effectiveness of feature selection in microarray-based cancer classification.We selected leave-one-out cross-validation(LOOCV)to evaluate the performance of both two widely used classifiers,k-nearest neighbors(KNN)and support vector machine(SVM),on high-dimensional cancer microarray data.The proposed method is extensively tested on six publicly available cancer microarray datasets,and a comprehensive comparison with recently published methods is conducted.Our hybrid algorithm demonstrates its effectiveness in improving classification performance,Surpassing alternative approaches in terms of precision.The outcomes confirm the capability of our method to substantially improve both the precision and efficiency of cancer classification,thereby advancing the development ofmore efficient treatment strategies.The proposed hybridmethod offers a promising solution to the gene selection problem in microarray-based cancer classification.It improves the accuracy and efficiency of cancer diagnosis and treatment,and its superior performance compared to other methods highlights its potential applicability in realworld cancer classification tasks.By harnessing the complementary search mechanisms of GWO and HHO,we leverage their bio-inspired behavior to identify informative genes relevant to cancer diagnosis and treatment.
基金Supported by the Basic Scientific Research Projects of the Central University of China(ZXH2010D010)the National Natural Science Foundation of China(60979021/F01)~~
文摘In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical job shop-schedule problem is adopted and three types of special aircraft-taxi conflicts are considered in the constraints. To solve such nondeterministic polynomial time-complex problems, the immune clonal selection algorithm（ICSA） is introduced. The simulation results in a congested hour of Beijing Capital International Airport show that, compared with the first-come-first-served（FCFS） strategy, the optimization-planning strategy reduces the total scheduling time by 13.6 min and the taxiing time per aircraft by 45.3 s, which improves the capacity of the runway and the efficiency of airport operations.
基金co-supported by the Equipment Pre-research Foundation Project of China (No. JZX7Y20190243016301)Helicopter Transmission Technology Key Laboratory Foundation of China (No. KY-52-2018-0024)the Fundamental Research Funds for the Central Universities & Funding of Jiangsu Innovation Program for Graduate Education under Grant (No. KYLX16_0336)
文摘Planetary gear train is a prominent component of helicopter transmission system and its health is of great significance for the flight safety of the helicopter.During health condition monitoring,the selection of a fault sensitive feature subset is meaningful for fault diagnosis of helicopter planetary gear train.According to actual situation,this paper proposed a multi-criteria fusion feature selection algorithm (MCFFSA) to identify an optimal feature subset from the highdimensional original feature space.In MCFFSA,a fault feature set of multiple domains,including time domain,frequency domain and wavelet domain,is first extracted from the raw vibration dataset.Four targeted criteria are then fused by multi-objective evolutionary algorithm based on decomposition (MOEA/D) to find Proto-efficient subsets,wherein two criteria for measuring diagnostic performance are assessed by sparse Bayesian extreme learning machine (SBELM).Further,Fmeasure is adopted to identify the optimal feature subset,which was employed for subsequent fault diagnosis.The effectiveness of MCFFSA is validated through six fault recognition datasets from a real helicopter transmission platform.The experimental results illustrate the superiority of combination of MOEA/D and SBELM in MCFFSA,and comparative analysis demonstrates that the optimal feature subset provided by MCFFSA can achieve a better diagnosis performance than other algorithms.
基金supported by the Institutional Fund Projects(IFPIP-1481-611-1443)the Key Projects of Natural Science Research in Anhui Higher Education Institutions(2022AH051909)+1 种基金the Provincial Quality Project of Colleges and Universities in Anhui Province(2022sdxx020,2022xqhz044)Bengbu University 2021 High-Level Scientific Research and Cultivation Project(2021pyxm04)。
文摘A dandelion algorithm(DA) is a recently developed intelligent optimization algorithm for function optimization problems. Many of its parameters need to be set by experience in DA,which might not be appropriate for all optimization problems. A self-adapting and efficient dandelion algorithm is proposed in this work to lower the number of DA's parameters and simplify DA's structure. Only the normal sowing operator is retained;while the other operators are discarded. An adaptive seeding radius strategy is designed for the core dandelion. The results show that the proposed algorithm achieves better performance on the standard test functions with less time consumption than its competitive peers. In addition, the proposed algorithm is applied to feature selection for credit card fraud detection(CCFD), and the results indicate that it can obtain higher classification and detection performance than the-state-of-the-art methods.
基金the National Natural Science Foundation of China(62076225,62073300)the Natural Science Foundation for Distinguished Young Scholars of Hubei(2019CFA081)。
文摘Solving constrained multi-objective optimization problems with evolutionary algorithms has attracted considerable attention.Various constrained multi-objective optimization evolutionary algorithms(CMOEAs)have been developed with the use of different algorithmic strategies,evolutionary operators,and constraint-handling techniques.The performance of CMOEAs may be heavily dependent on the operators used,however,it is usually difficult to select suitable operators for the problem at hand.Hence,improving operator selection is promising and necessary for CMOEAs.This work proposes an online operator selection framework assisted by Deep Reinforcement Learning.The dynamics of the population,including convergence,diversity,and feasibility,are regarded as the state;the candidate operators are considered as actions;and the improvement of the population state is treated as the reward.By using a Q-network to learn a policy to estimate the Q-values of all actions,the proposed approach can adaptively select an operator that maximizes the improvement of the population according to the current state and thereby improve the algorithmic performance.The framework is embedded into four popular CMOEAs and assessed on 42 benchmark problems.The experimental results reveal that the proposed Deep Reinforcement Learning-assisted operator selection significantly improves the performance of these CMOEAs and the resulting algorithm obtains better versatility compared to nine state-of-the-art CMOEAs.
基金This work was partially supported by the National Natural Science Foundation of China(61876089,61876185,61902281,61375121)the Opening Project of Jiangsu Key Laboratory of Data Science and Smart Software(No.2019DS301)+1 种基金the Engineering Research Center of Digital Forensics,Ministry of Education,the Key Research and Development Program of Jiangsu Province(BE2020633)the Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘One of the main problems of machine learning and data mining is to develop a basic model with a few features,to reduce the algorithms involved in classification’s computational complexity.In this paper,the collection of features has an essential importance in the classification process to be able minimize computational time,which decreases data size and increases the precision and effectiveness of specific machine learning activities.Due to its superiority to conventional optimization methods,several metaheuristics have been used to resolve FS issues.This is why hybrid metaheuristics help increase the search and convergence rate of the critical algorithms.A modern hybrid selection algorithm combining the two algorithms;the genetic algorithm(GA)and the Particle Swarm Optimization(PSO)to enhance search capabilities is developed in this paper.The efficacy of our proposed method is illustrated in a series of simulation phases,using the UCI learning array as a benchmark dataset.
文摘Multi-Objective Evolutionary Algorithms(MOEAs)have significantly advanced the domain of MultiObjective Optimization(MOO),facilitating solutions for complex problems with multiple conflicting objectives.This review explores the historical development of MOEAs,beginning with foundational concepts in multi-objective optimization,basic types of MOEAs,and the evolution of Pareto-based selection and niching methods.Further advancements,including decom-position-based approaches and hybrid algorithms,are discussed.Applications are analyzed in established domains such as engineering and economics,as well as in emerging fields like advanced analytics and machine learning.The significance of MOEAs in addressing real-world problems is emphasized,highlighting their role in facilitating informed decision-making.Finally,the development trajectory of MOEAs is compared with evolutionary processes,offering insights into their progress and future potential.
基金Supported by the National Science Foundation of China(60133010)Supported by the Science Foundation of Henan Province(2000110019)
文摘There has been a growing interest in mathematical models to character the evolutionary algorithms. The best-known one of such models is the axiomatic model called the abstract evolutionary algorithm （AEA）, which unifies most of the currently known evolutionary algorithms and describes the evolution as an abstract stochastic process composed of two fundamental abstract operators： abstract selection and evolution operators. In this paper, we first introduce the definitions of the generalized abstract selection and evolution operators. Then we discuss the characterization of some parameters related to generalized abstract selection and evolution operators. Based on these operators, we finally give the strong convergence of the generalized abstract evolutionary algorithm. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.
文摘<strong>Objective</strong>: This paper aims to explore clinical status and related influence factors of pressure injury (PI) in the elderly inpatients with kidney disease, so as to provide reference for the prevention and treatment of PI in the elderly inpatients with kidney disease. <strong>Methods</strong>: Retrospective collection method is adopted to collect 158 clinical cases of the elderly inpatients with kidney disease aged ≥ 60 in the Nephrology Department, the First Affiliated Hospital of Jinan University from January 2017 to December 2019, and then least absolute shrinkage and selection Operator (LASSO) regression analysis is used to analyze 17 possible influence factors;finally Logistic regression model is established to analyze and screen influence factors of risk. <strong>Results</strong>: 1) Among 158 elderly inpatients with medium and high risk of PI, the incidence of PI is 20.25%;the most common stage of injury is stage I (42.5%);sacrococcygeal (60%) is the high-risk site of pressure injury. 2) LASSO regression analysis shows that history of present respiratory infection/respiratory failure (<em>β </em>= 1.2714. <em>P</em> < 0.05) and hospitalization time (<em>β</em> = 0.4177. <em>P </em>< 0.05) are independent factors influencing PI risk in the elderly inpatients with kidney disease. <strong>Concl</strong><strong>usio</strong><strong>n</strong>: The elderly patients with kidney disease and PI risk are the high incidence population of hospital acquired PI;for the elderly inpatients with kidney disease and having respiratory infection history or respiratory failure, prolonged hospitalization will significantly increase the risk of PI. Therefore, targeted preventive and control measures should be taken to reduce the incidence of PI.
基金Projects(20976048, 21176072) supported by the National Natural Science Foundation of ChinaProject provided by the Fundamental Research Fund for Central Universities
文摘In this work, focusing on the demerit of AEA (Alopex-based evolutionary algorithm) algorithm, an improved AEA algorithm (AEA-C) which was fused AEA with clonal selection algorithm was proposed. Considering the irrationality of the method that generated candidate solutions at each iteration of AEA, clonal selection algorithm could be applied to improve the method. The performance of the proposed new algorithm was studied by using 22 benchmark functions and was compared with original AEA given the same conditions. The experimental results show that the AEA-C clearly outperforms the original AEA for almost all the 22 benchmark functions with 10, 30, 50 dimensions in success rates, solution quality and stability. Furthermore, AEA-C was applied to estimate 6 kinetics parameters of the fermentation dynamics models. The standard deviation of the objective function calculated by the AEA-C is 41.46 and is far less than that of other literatures' results, and the fitting curves obtained by AEA-C are more in line with the actual fermentation process curves.
基金This work is supported by the National Natural Science Foundation of ChinaVisiting Scholar Foundation of Key Lab,in Univers
文摘This paper discusses the convergence rates about a class of evolutionary algorithms in general search spaces by means of the ergodic theory in Markov chain and some techniques in Banach algebra.Under certain conditions that transition probability functions of Markov chains corresponding to evolutionary algorithms satisfy,the authors obtain the convergence rates of the exponential order.Furthermore,they also analyze the characteristics of the conditions which can be met by genetic operators and selection strategies.
基金the Chinese Clinical Trial Registry(No.ChiCTR2000040109)approved by the Hospital Ethics Committee(No.20210130017).
文摘BACKGROUND Difficulty of colonoscopy insertion(DCI)significantly affects colonoscopy effectiveness and serves as a key quality indicator.Predicting and evaluating DCI risk preoperatively is crucial for optimizing intraoperative strategies.AIM To evaluate the predictive performance of machine learning(ML)algorithms for DCI by comparing three modeling approaches,identify factors influencing DCI,and develop a preoperative prediction model using ML algorithms to enhance colonoscopy quality and efficiency.METHODS This cross-sectional study enrolled 712 patients who underwent colonoscopy at a tertiary hospital between June 2020 and May 2021.Demographic data,past medical history,medication use,and psychological status were collected.The endoscopist assessed DCI using the visual analogue scale.After univariate screening,predictive models were developed using multivariable logistic regression,least absolute shrinkage and selection operator(LASSO)regression,and random forest(RF)algorithms.Model performance was evaluated based on discrimination,calibration,and decision curve analysis(DCA),and results were visualized using nomograms.RESULTS A total of 712 patients(53.8%male;mean age 54.5 years±12.9 years)were included.Logistic regression analysis identified constipation[odds ratio(OR)=2.254,95%confidence interval(CI):1.289-3.931],abdominal circumference(AC)(77.5–91.9 cm,OR=1.895,95%CI:1.065-3.350;AC≥92 cm,OR=1.271,95%CI:0.730-2.188),and anxiety(OR=1.071,95%CI:1.044-1.100)as predictive factors for DCI,validated by LASSO and RF methods.Model performance revealed training/validation sensitivities of 0.826/0.925,0.924/0.868,and 1.000/0.981;specificities of 0.602/0.511,0.510/0.562,and 0.977/0.526;and corresponding area under the receiver operating characteristic curves(AUCs)of 0.780(0.737-0.823)/0.726(0.654-0.799),0.754(0.710-0.798)/0.723(0.656-0.791),and 1.000(1.000-1.000)/0.754(0.688-0.820),respectively.DCA indicated optimal net benefit within probability thresholds of 0-0.9 and 0.05-0.37.The RF model demonstrated superior diagnostic accuracy,reflected by perfect training sensitivity(1.000)and highest validation AUC(0.754),outperforming other methods in clinical applicability.CONCLUSION The RF-based model exhibited superior predictive accuracy for DCI compared to multivariable logistic and LASSO regression models.This approach supports individualized preoperative optimization,enhancing colonoscopy quality through targeted risk stratification.
