A New Population Initialization of Particle Swarm Optimization Method Based on PCA for Feature Selection

In many fields such as signal processing,machine learning,pattern recognition and data mining,it is common practice to process datasets containing huge numbers of features.In such cases,Feature Selection(FS)is often involved.Meanwhile,owing to their excellent global search ability,evolutionary computation techniques have been widely employed to the FS.So,as a powerful global search method and calculation fast than other EC algorithms,PSO can solve features selection problems well.However,when facing a large number of feature selection,the efficiency of PSO drops significantly.Therefore,plenty of works have been done to improve this situation.Besides,many studies have shown that an appropriate population initialization can effectively help to improve this problem.So,basing on PSO,this paper introduces a new feature selection method with filter-based population.The proposed algorithm uses Principal Component Analysis(PCA)to measure the importance of features first,then based on the sorted feature information,a population initialization method using the threshold selection and the mixed initialization is proposed.The experiments were performed on several datasets and compared to several other related algorithms.Experimental results show that the accuracy of PSO to solve feature selection problems is significantly improved after using proposed method.

Generalized Self-Adaptive Genetic Algorithms

In order to solve the problem between searching performance and convergence of genetic algorithms, a fast genetic algorithm generalized self-adaptive genetic algorithm (GSAGA) is presented. (1) Evenly distributed initial population is generated. (2) Superior individuals are not broken because of crossover and mutation operation for they are sent to subgeneration directly. (3) High quality im- migrants are introduced according to the condition of the population schema. (4) Crossover and mutation are operated on self-adaptation. Therefore, GSAGA solves the coordination problem between convergence and searching performance. In GSAGA, the searching per- formance and global convergence are greatly improved compared with many existing genetic algorithms. Through simulation, the val- idity of this modified genetic algorithm is proved.

Artificial bee colony algorithm with comprehensive search mechanism for numerical optimization

The artificial bee colony （ABC） algorithm is a sim- ple and effective global optimization algorithm which has been successfully applied in practical optimization problems of various fields. However, the algorithm is still insufficient in balancing ex- ploration and exploitation. To solve this problem, we put forward an improved algorithm with a comprehensive search mechanism. The search mechanism contains three main strategies. Firstly, the heuristic Gaussian search strategy composed of three different search equations is proposed for the employed bees, which fully utilizes and balances the exploration and exploitation of the three different search equations by introducing the selectivity probability P,. Secondly, in order to improve the search accuracy, we propose the Gbest-guided neighborhood search strategy for onlooker bees to improve the exploitation performance of ABC. Thirdly, the self- adaptive population perturbation strategy for the current colony is used by random perturbation or Gaussian perturbation to en- hance the diversity of the population. In addition, to improve the quality of the initial population, we introduce the chaotic opposition- based learning method for initialization. The experimental results and Wilcoxon signed ranks test based on 27 benchmark func- tions show that the proposed algorithm, especially for solving high dimensional and complex function optimization problems, has a higher convergence speed and search precision than ABC and three other current ABC-based algorithms.

Measurements of Majorana transition frequency shift in caesium atomic fountain clocks

The caesium atomic fountain clock is a primary frequency standard.During its operation,a Majorana transition frequency shift will occur once a magnetic field at some special locations along the atomic trajectory is singular.In this study,by developing a physical model,we analyzed the magnetic field requirements for atomic adiabatic transition and calculated the influence of the Majorana atomic transition on the atomic state via a quantum method.Based on the simulation results for the magnetic field in the fountain clock,we applied the Monte Carlo method to simulate the relationship between the Majorana transition frequency shift and the magnetic field at the entrance of the magnetic shielding,as well as the initial atomic population.Measurement of the Majorana transition frequency shift was realized by state-selecting asymmetrically populated atoms.The relationship between the Majorana transition frequency shift and the axial magnetic field at the entrance of the magnetic shielding was obtained.The measured results were essentially consistent with the calculated results.Thus,the magnetic field at the entrance of the magnetic shielding was configured,and the Majorana transition frequency shift of the fountain clock was calculated to be 4.57×10^(-18).