佳点集遗传覆盖算法  

Good Point-set Genetic Covering Algorithm

作　　者：贾瑞玉[1] 李永顺[1] 李景成[1] 冯伦阔[1] 

机构地区：[1]安徽大学计算智能与信号处理教育部重点实验室

出　　处：《计算机工程》2009年第24期196-198,共3页Computer Engineering

基　　金：安徽省高等学校省级自然科学基金资助项目(KJ2008B092)

摘　　要：针对覆盖算法中识别精度与泛化能力之间的一对矛盾,结合佳点集遗传算法思想,提出佳点集遗传覆盖算法。通过在覆盖种群中引入竞争,淘汰不好的覆盖,保留较优的覆盖,减少了覆盖个数和拒识样本个数,从而提高了整体覆盖种群的分类能力。与Lib-SVM、领域覆盖、交叉覆盖的对比实验证明了该算法具有良好的分类识别精度与泛化能力。Aiming at solving the conflict between validity and extensibility of the covering algorithm,this paper combines good point-set genetic algorithm with covering algorithm,and presents a good point-set genetic covering algorithm.The algorithm brings competition in the population of cover sets,eliminates the poor cover and retains the better cover,signally reduces the number of coverage and the number of samples rejection,so it raises the classification capacity of the total population.By comparing with Lib-SVM and neighborhood covering and alternative covering algorithm,experimental results prove that this algorithm has a good validity and extensibility.

关 键 词：佳点集遗传算法 机器学习 领域覆盖 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]