To accelerate the selection process of feature subsets in the rough set theory （RST）, an ensemble elitist roles based quantum game （EERQG） algorithm is proposed for feature selec- tion. Firstly, the multilevel eli...To accelerate the selection process of feature subsets in the rough set theory （RST）, an ensemble elitist roles based quantum game （EERQG） algorithm is proposed for feature selec- tion. Firstly, the multilevel elitist roles based dynamics equilibrium strategy is established, and both immigration and emigration of elitists are able to be self-adaptive to balance between exploration and exploitation for feature selection. Secondly, the utility matrix of trust margins is introduced to the model of multilevel elitist roles to enhance various elitist roles＇ performance of searching the optimal feature subsets, and the win-win utility solutions for feature selec- tion can be attained. Meanwhile, a novel ensemble quantum game strategy is designed as an intriguing exhibiting structure to perfect the dynamics equilibrium of multilevel elitist roles. Finally, the en- semble manner of multilevel elitist roles is employed to achieve the global minimal feature subset, which will greatly improve the fea- sibility and effectiveness. Experiment results show the proposed EERQG algorithm has superiority compared to the existing feature selection algorithms.展开更多
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 conditio...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.展开更多
In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every ...In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every generation, and for each solution a fitness value is calculated according to a fitness function, which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework. After the improved selection, crossover and mutation, an elitist individual is restructured based on the strategy of restructuring elitist. This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals. The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value. Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.展开更多
基金supported by the National Natural Science Foundation of China(6113900261171132+4 种基金61300167)the Natural Science Foundation of Jiangsu Education Department(12KJB520013)the Open Project Program of Jiangsu Provincial Key Laboratory of Computer Information Processing Technologythe Qing Lan Project of Jiangsu Provincethe Starting Foundation for Doctoral Scientific Research,Nantong University(14B20)
文摘To accelerate the selection process of feature subsets in the rough set theory （RST）, an ensemble elitist roles based quantum game （EERQG） algorithm is proposed for feature selec- tion. Firstly, the multilevel elitist roles based dynamics equilibrium strategy is established, and both immigration and emigration of elitists are able to be self-adaptive to balance between exploration and exploitation for feature selection. Secondly, the utility matrix of trust margins is introduced to the model of multilevel elitist roles to enhance various elitist roles＇ performance of searching the optimal feature subsets, and the win-win utility solutions for feature selec- tion can be attained. Meanwhile, a novel ensemble quantum game strategy is designed as an intriguing exhibiting structure to perfect the dynamics equilibrium of multilevel elitist roles. Finally, the en- semble manner of multilevel elitist roles is employed to achieve the global minimal feature subset, which will greatly improve the fea- sibility and effectiveness. Experiment results show the proposed EERQG algorithm has superiority compared to the existing feature selection algorithms.
基金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.
文摘In this paper, elitist reconstruction genetic algorithm （ERGA） based on Markov random field （MRF） is introduced for image segmentation. In this algorithm, a population of possible solutions is maintained at every generation, and for each solution a fitness value is calculated according to a fitness function, which is constructed based on the MRF potential function according to Metropolis function and Bayesian framework. After the improved selection, crossover and mutation, an elitist individual is restructured based on the strategy of restructuring elitist. This procedure is processed to select the location that denotes the largest MRF potential function value in the same location of all individuals. The algorithm is stopped when the change of fitness functions between two sequent generations is less than a specified value. Experiments show that the performance of the hybrid algorithm is better than that of some traditional algorithms.
