首页 | 本学科首页   官方微博 | 高级检索  
     

等价划分与蚁群优化的属性约简改进策略
引用本文:王慧,王京.等价划分与蚁群优化的属性约简改进策略[J].北京邮电大学学报,2011,34(6):55-58.
作者姓名:王慧  王京
作者单位:北京科技大学信息工程学院,北京100083;中国人民公安大学信息安全工程系,北京100038;北京科技大学信息工程学院,北京,100083
基金项目:国家高技术研究发展计划项目(2009AA04Z136)
摘    要:为降低经典信息熵属性约简算法的时间复杂度,在论证信息熵属性约简与论域对象划分细化约简等价的基础上,提出将蚁群并行优化处理机制引入划分细化约简过程的思想,蚁群搜索过程将属性重要性度量融入状态转移及信息素更新策略以对每次约简结果进行优化。通过复杂性分析与实例验证,该算法更适于大容量数据表的属性约简,可有效避免蚁群搜索的盲目性并在较小迭代规模下快速获得约简集。

关 键 词:数据挖掘  蚁群优化  等价划分  属性约简
收稿时间:2011-06-02

An Improvement Strategy of Attribute Reduction on Partition and Ant Colony Optimization
WANG Hui , WANG Jing.An Improvement Strategy of Attribute Reduction on Partition and Ant Colony Optimization[J].Journal of Beijing University of Posts and Telecommunications,2011,34(6):55-58.
Authors:WANG Hui  WANG Jing
Affiliation:1 (1.School of Information Engineering,University of Science and Technology,Beijing 100083,China; 2.Department of Information Security Engineering,Chinese People’s Public Security University,Beijing 100038,China)
Abstract:To decrease the time complexity of the attribute reduction algorithm based on information entropy, the concurrent processing of ants colony optimization is introduced into partition. This process based on the judgement of attribute reduction between partition and information entropy. In this searching process the strategy of state transfer and pheromone update reflect the difference of the attribute’s importance in order to optimize the results. By the analysis of this algorithm’s complexity and the example’s application,it is shown that the algorithm can avoid the blindness of the ant colony searching and reduce the size of the iteration to obtain reduction faster.This is more suitable for large data base.
Keywords:
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号