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

粗糙集属性约简贪心算法的改进
引用本文:宁伟,张坤.粗糙集属性约简贪心算法的改进[J].泰山学院学报,2008,30(3).
作者姓名:宁伟  张坤
作者单位:1. 泰山学院,经济管理系,山东,泰安,271021
2. 山东政法学院,山东,济南,250014
基金项目:泰山学院校科研和教改项目
摘    要:将单个属性按照B精度的均值和方差决定的属性重要性,从大到小依次加入到约简属性中.对重要性相等的属性,再计算划分的B精度来决定加入哪些属性,直到满足约简条件为止.与不用属性重要性的算法相比,计算量较少,提高了计算速度.

关 键 词:粗糙集  属性约简  算法  属性重要性

The Improvement of Greedy Algorithm for Attribute Reduction Based on Rough Sets Theory
NING Wei,ZHANG Kun.The Improvement of Greedy Algorithm for Attribute Reduction Based on Rough Sets Theory[J].Journal of Taishan University,2008,30(3).
Authors:NING Wei  ZHANG Kun
Institution:NING Wei~1 ZHANG Kun~2 1.Department of Economics , Management,Taishan University,Tai\'an,271021,2.Sh,ong Institute of Political Science , Law,Jinan,250014,China
Abstract:The importance of a single attribute which is decided by the average and variance of B-precision is joined to the reduction attribute from small ones to big ones.If they are equal,count the B-precision of partition until it satisfies the condition.Compared with the algorithm that doesn't use the importance of attribute,this meth- od requires less computational effort than the latter,thus the efficiency of attribute reduction is able to be improved.
Keywords:rough sets  reduction of attribute  algorithm  importance of attribute  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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