| 佳点集遗传覆盖算法 |
| |
| 引用本文： | 贾瑞玉,李永顺,李景成,冯伦阔.佳点集遗传覆盖算法[J].计算机工程,2009,35(24):196-198. |
| |
| 作者姓名： | 贾瑞玉 李永顺 李景成 冯伦阔 |
| |
| 作者单位： | 安徽大学计算智能与信号处理教育部重点实验室,合肥,230039 |
| |
| 基金项目： | 安徽省高等学校省级自然科学基金资助项目 |
| |
| 摘 要： | 针对覆盖算法中识别精度与泛化能力之间的一对矛盾,结合佳点集遗传算法思想,提出佳点集遗传覆盖算法。通过在覆盖种群中引入竞争,淘汰不好的覆盖,保留较优的覆盖,减少了覆盖个数和拒识样本个数,从而提高了整体覆盖种群的分类能力。与Lib-SVM、领域覆盖、交叉覆盖的对比实验证明了该算法具有良好的分类识别精度与泛化能力。
|
| 关 键 词： | 佳点集遗传算法 机器学习 领域覆盖 |
| 修稿时间： | |
Good Point-set Genetic Covering Algorithm |
| |
| JIA Rui-yu,LI Yong-shun,LI Jing-cheng,FENG Lun-kuo.Good Point-set Genetic Covering Algorithm[J].Computer Engineering,2009,35(24):196-198. |
| |
| Authors: | JIA Rui-yu LI Yong-shun LI Jing-cheng FENG Lun-kuo |
| |
| Affiliation: | (Key Laboratory of Intelligent Computing & Signal Processing, Ministry of Education, Anhui University, Hefei 230039) |
| |
| Abstract: | 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. |
| |
| Keywords: | good point-set genetic algorithm machine learning neighborhood covering |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
