| 知识约简的多族蚁群算法 |
| |
| 引用本文： | 王俊峰,陆伟峰,朱庆保.知识约简的多族蚁群算法[J].金陵科技学院学报,2005,21(1):8-12. |
| |
| 作者姓名： | 王俊峰 陆伟峰 朱庆保 |
| |
| 作者单位： | 南京师范大学数学与计算机科学学院,江苏,南京,210097 |
| |
| 摘 要： | Rough集理论中知识约简是个NP-hard问题，已有的方法都有不同的局限性。受蚁群算法的启发，通过将条件属性集映射到有向图结构，并采用两族群蚂蚁协作共同完成求解，提出了知识约简的多族蚁群算法。采用多族群蚂蚁协作后，改善了一般蚁群算法收敛速度较慢的问题，提高了求解速度。通过实验验证，它是一种非常有效的方法。
|
| 关 键 词： | 蚁群算法 Rough集 知识约简 |
| 文章编号： | 1672-755(2005)01-0008-05 |
| 修稿时间： | 2004年10月13 |
A Knowledge Reduction Method Based on Cooperating Two Ant Colony Families Algorithm |
| |
| WANG Jun-feng,LU Wei-feng,ZHU Qin-bao.A Knowledge Reduction Method Based on Cooperating Two Ant Colony Families Algorithm[J].Journal of Jinling Institute of Technology,2005,21(1):8-12. |
| |
| Authors: | WANG Jun-feng LU Wei-feng ZHU Qin-bao |
| |
| Abstract: | Knowledge Reduction of Rough Sets theory is a kind of NP-hard problem. The existing methods for solving this problem have limits. Inspired by Ant Colony Algorithm, a new approach to knowledge reduction based on cooperating two Ant Colony families Algorithm has been presented in this paper. And the results of the experiments show efficiency. |
| |
| Keywords: | ant colony algorithm rough sets knowledge reduction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
