摘要
本文提出一种遗传顺序IB算法,该算法以基本顺序IB算法的多次运行结果作为初始种群,并基于集成操作算子将初始种群组合为一个解;然后算法分别计算解中每个元素的不确定性统计量,对解中元素进行选择和变异,最后经过若干代变异后得到优化的解.在数据集上的实验结果表明,相对于顺序IB算法,遗传顺序IB算法具有运行效率高、解更优化的特点.
This paper proposes a genetic sequential IB algorithm. R takes several seeding solutions of the basic sequential IB algorithm as initial population, and then integrates this population into a solution using the integration operator. Sequentially, some certain positions of the obtained solution are selected and mutated iteratively based on the defined instability statistic. After mutation of several generations, the iterative process terminates and a more optimal solution is obtained. Experimental results on the benchmark data sets indicate that the proposed algorithm outperforms the sequential IB algorithm in both the accuracy and the efficiency.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2009年第8期1804-1809,共6页
Acta Electronica Sinica
基金
国家自然科学基金(No.60573029
No.60773048
No.60773050)
关键词
IB理论
SIB算法
遗传变异
互信息
IB theory
sIB algorithm
genetic variation
mutual information