The artificial immune system,an excellent prototype for developingMachine Learning,is inspired by the function of the powerful natural immune system.As one of the prevalent classifiers,the Dendritic Cell Algorithm(DCA...The artificial immune system,an excellent prototype for developingMachine Learning,is inspired by the function of the powerful natural immune system.As one of the prevalent classifiers,the Dendritic Cell Algorithm(DCA)has been widely used to solve binary problems in the real world.The classification of DCA depends on a data preprocessing procedure to generate input signals,where feature selection and signal categorization are themain work.However,the results of these studies also show that the signal generation of DCA is relatively weak,and all of them utilized a filter strategy to remove unimportant attributes.Ignoring filtered features and applying expertise may not produce an optimal classification result.To overcome these limitations,this study models feature selection and signal categorization into feature grouping problems.This study hybridizes Grouping Genetic Algorithm(GGA)with DCA to propose a novel DCA version,GGA-DCA,for accomplishing feature selection and signal categorization in a search process.The GGA-DCA aims to search for the optimal feature grouping scheme without expertise automatically.In this study,the data coding and operators of GGA are redefined for grouping tasks.The experimental results show that the proposed algorithm has significant advantages over the compared DCA expansion algorithms in terms of signal generation.展开更多
AIM： To figure out the contributed factors of the hospitalization expenses of senile cataract patients（HECP） and build up an area-specified senile cataract diagnosis related group（DRG） of Shanghai thereby formula...AIM： To figure out the contributed factors of the hospitalization expenses of senile cataract patients（HECP） and build up an area-specified senile cataract diagnosis related group（DRG） of Shanghai thereby formulating the reference range of HECP and providing scientific basis for the fair use and supervision of the health care insurance fund.METHODS： The data was collected from the first page of the medical records of 22 097 hospitalized patients from tertiary hospitals in Shanghai from 2010 to 2012 whose major diagnosis were senile cataract. Firstly, we analyzed the influence factors of HECP using univariate and multivariate analysis. DRG grouping was conducted according to the exhaustive Chi-squared automatic interaction detector（E-CHAID） model, using HECP as target variable. Finally we evaluated the grouping results using non-parametric test such as Kruskal-Wallis H test, RIV, CV, etc.RESULTS： The 6 DRGs were established as well as criterion of HECP, using age, sex, type of surgery and whether complications/comorbidities occurred as the key variables of classification node of senile cataract cases.CONCLUSION： The grouping of senile cataract cases based on E-CHAID algorithm is reasonable. And the criterion of HECP based on DRG can provide a feasible way of management in the fair use and supervision of medical insurance fund.展开更多
Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic alg...Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic algorithm is used to search the weight of the neural network. At the same time, the multi-objective-based evaluation function is adopted, in which there are three main indicators including the passenger waiting time, car passengers number and the number of stops. Different weights are given to meet the actual needs. The optimal values of the evaluation function are obtained, and the optimal dispatch control of the elevator group control system based on neural network is realized. By analyzing the running of the elevator group control system, all the processes and steps are presented. The validity of the hybrid algorithm is verified by the dynamic imitation performance.展开更多
This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance ...This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.展开更多
To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulat...To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulated annealing method is introduced to the algorithm. Through setting the temperature changing with the iterations, after each turn of tours, the solution set obtained by the ants is taken as the candidate set. The update set is obtained by adding the solutions in the candidate set to the previous update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the trail information on the current best route. The trail information is reset when the algorithm is in stagnation state. The computer experiments demonstrate that the proposed algorithm has higher stability and convergence speed.展开更多
Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential ev...Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential evolution( HDE) algorithm based on greedy constructive procedure( GCP) is proposed,which combines differential evolution( DE) with tabu search( TS). DE is applied to generating the elite individuals of population,while TS is used for finding the optimal value by making perturbation in selected elite individuals. A lower bounding technique is developed to evaluate the quality of proposed algorithm. Experimental results verify the effectiveness and feasibility of proposed algorithm.展开更多
基金NSFC http://www.nsfc.gov.cn/for the support through Grants No.61877045Fundamental Research Project of Shenzhen Science and Technology Program for the support through Grants No.JCYJ2016042815-3956266.
文摘The artificial immune system,an excellent prototype for developingMachine Learning,is inspired by the function of the powerful natural immune system.As one of the prevalent classifiers,the Dendritic Cell Algorithm(DCA)has been widely used to solve binary problems in the real world.The classification of DCA depends on a data preprocessing procedure to generate input signals,where feature selection and signal categorization are themain work.However,the results of these studies also show that the signal generation of DCA is relatively weak,and all of them utilized a filter strategy to remove unimportant attributes.Ignoring filtered features and applying expertise may not produce an optimal classification result.To overcome these limitations,this study models feature selection and signal categorization into feature grouping problems.This study hybridizes Grouping Genetic Algorithm(GGA)with DCA to propose a novel DCA version,GGA-DCA,for accomplishing feature selection and signal categorization in a search process.The GGA-DCA aims to search for the optimal feature grouping scheme without expertise automatically.In this study,the data coding and operators of GGA are redefined for grouping tasks.The experimental results show that the proposed algorithm has significant advantages over the compared DCA expansion algorithms in terms of signal generation.
基金Supported by the Key Research and Development Program of Hunan Province(No.2017SK2011)
文摘AIM： To figure out the contributed factors of the hospitalization expenses of senile cataract patients（HECP） and build up an area-specified senile cataract diagnosis related group（DRG） of Shanghai thereby formulating the reference range of HECP and providing scientific basis for the fair use and supervision of the health care insurance fund.METHODS： The data was collected from the first page of the medical records of 22 097 hospitalized patients from tertiary hospitals in Shanghai from 2010 to 2012 whose major diagnosis were senile cataract. Firstly, we analyzed the influence factors of HECP using univariate and multivariate analysis. DRG grouping was conducted according to the exhaustive Chi-squared automatic interaction detector（E-CHAID） model, using HECP as target variable. Finally we evaluated the grouping results using non-parametric test such as Kruskal-Wallis H test, RIV, CV, etc.RESULTS： The 6 DRGs were established as well as criterion of HECP, using age, sex, type of surgery and whether complications/comorbidities occurred as the key variables of classification node of senile cataract cases.CONCLUSION： The grouping of senile cataract cases based on E-CHAID algorithm is reasonable. And the criterion of HECP based on DRG can provide a feasible way of management in the fair use and supervision of medical insurance fund.
基金Supported by National Natural Science Foundation of China (No60874077) Specialized Research Funds for Doctoral Program of Higher Education of China (No20060056054) Research Funds for Scientific Financing Projects of Quality Control Public Welfare Profession (No2007GYB172)
文摘Aiming at the diversity and nonlinearity of the elevator system control target, an effective group method based on a hybrid algorithm of genetic algorithm and neural network is presented in this paper. The genetic algorithm is used to search the weight of the neural network. At the same time, the multi-objective-based evaluation function is adopted, in which there are three main indicators including the passenger waiting time, car passengers number and the number of stops. Different weights are given to meet the actual needs. The optimal values of the evaluation function are obtained, and the optimal dispatch control of the elevator group control system based on neural network is realized. By analyzing the running of the elevator group control system, all the processes and steps are presented. The validity of the hybrid algorithm is verified by the dynamic imitation performance.
文摘This paper presents the two-machine flowshop group scheduling problem with the optimal objective of maximum lateness. A dominance rule within group and a dominance rule between groups are established. These dominance rules along with a previously established dominance rule are used to develop a heuristic algorithm. Experimental results are given and analyzed.
基金Project supported by the National Natural Science Foundation of China (Grant No.50608069)
文摘To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulated annealing method is introduced to the algorithm. Through setting the temperature changing with the iterations, after each turn of tours, the solution set obtained by the ants is taken as the candidate set. The update set is obtained by adding the solutions in the candidate set to the previous update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the trail information on the current best route. The trail information is reset when the algorithm is in stagnation state. The computer experiments demonstrate that the proposed algorithm has higher stability and convergence speed.
基金Shanghai Municipal Natural Science Foundation of China(No.10ZR1431700)
文摘Aiming at the flexible flowshop group scheduling problem,taking sequence dependent setup time and machine skipping into account, a mathematical model for minimizing makespan is established,and a hybrid differential evolution( HDE) algorithm based on greedy constructive procedure( GCP) is proposed,which combines differential evolution( DE) with tabu search( TS). DE is applied to generating the elite individuals of population,while TS is used for finding the optimal value by making perturbation in selected elite individuals. A lower bounding technique is developed to evaluate the quality of proposed algorithm. Experimental results verify the effectiveness and feasibility of proposed algorithm.
