针对UBGM(1,1)-Markov模型中存在2个邻近值可能被归属到不同状态,导致预测值产生偏差的问题,结合模糊分类理论,构建基于模糊分类的无偏灰色-马尔科夫模型(unbiased gray-Markov model based on fuzzy classification,FC-UBGM(1,1)-Mark...针对UBGM(1,1)-Markov模型中存在2个邻近值可能被归属到不同状态,导致预测值产生偏差的问题,结合模糊分类理论,构建基于模糊分类的无偏灰色-马尔科夫模型(unbiased gray-Markov model based on fuzzy classification,FC-UBGM(1,1)-Markov)。首先对UBGM(1,1)模型进行残差修正,然后将修正后拟合值的相对残差序列作为Markov链进行区间划分,再结合模糊分类的隶属度函数,计算相对残差的模糊向量,根据隶属度确定其所属的状态。实际算例表明,该模型比传统UBGM(1,1)-Markov模型的预测效果更好。展开更多
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 colled the abstract evolutionary algorithm. In this paper, we...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 colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.展开更多
文摘针对UBGM(1,1)-Markov模型中存在2个邻近值可能被归属到不同状态,导致预测值产生偏差的问题,结合模糊分类理论,构建基于模糊分类的无偏灰色-马尔科夫模型(unbiased gray-Markov model based on fuzzy classification,FC-UBGM(1,1)-Markov)。首先对UBGM(1,1)模型进行残差修正,然后将修正后拟合值的相对残差序列作为Markov链进行区间划分,再结合模糊分类的隶属度函数,计算相对残差的模糊向量,根据隶属度确定其所属的状态。实际算例表明,该模型比传统UBGM(1,1)-Markov模型的预测效果更好。
基金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 colled the abstract evolutionary algorithm. In this paper, we first introduce the definitions of the abhstract selection and evolution operators, and that of the abstract evolutionary algorithm, which describes the evolution as an abstract stochastic process composed of these two fundamental abstract operators. In particular, a kind of abstract evolutionary algorithms based on a special selection mechansim is discussed. According to the sorting for the state space, the properties of the single step transition matrix for the algorithm are anaylzed. In the end, we prove that the limit probability distribution of the Markov chains exists. The present work provides a big step toward the establishment of a unified theory of evolutionary computation.
