首页 | 官方网站   微博 | 高级检索  
     

一种基于知识粒度的启发式属性约简算法
引用本文:马福民,张腾飞.一种基于知识粒度的启发式属性约简算法[J].计算机工程与应用,2012,48(36):31-33,38.
作者姓名:马福民  张腾飞
作者单位:1. 南京财经大学信息工程学院,南京,210046
2. 南京邮电大学自动化学院,南京,210046
基金项目:国家自然科学基金,江苏省自然科学基金,江苏省教育厅高校自然科学基金基础研究项目,南京财经大学科研基金项目资助
摘    要:属性约简是粗糙集理论进行知识获取的核心问题之一。根据属性相似度与知识粒度的一致性,通过条件属性与决策属性以及条件属性之间的相似度度量,提出了一种基于知识粒度的启发式属性约简算法。根据条件属性与决策属性的相似度对条件属性进行降序排列,根据条件属性之间的相似度度量选择重要的属性,从而得到约简集合。理论分析与实验结果表明,该算法具有较高的运行效率和较好的约简效果。

关 键 词:知识粒度  属性相似度  属性约简

New heuristic algorithm for attribute reduction based on knowledge granularity
MA Fumin , ZHANG Tengfei.New heuristic algorithm for attribute reduction based on knowledge granularity[J].Computer Engineering and Applications,2012,48(36):31-33,38.
Authors:MA Fumin  ZHANG Tengfei
Affiliation:1.School of Information Engineering,Nanjing University of Finance & Economics,Nanjing 210046,China 2.College of Automation,Nanjing University of Posts and Telecommunications,Nanjing 210046,China
Abstract:Attribute reduction is very important to knowledge acquisition in rough set theory. According to the consistency of attribute similarity and knowledge granularity, a new algorithm for attribute reduction based on knowledge granularity is proposed by calculating the similarity between condition attributes and decision attributes, as well as the similarity between condition attributes. The condition attributes are ordered descendingly based on the similarity between condition attributes and decision attributes, and the reduction set is obtained by selecting the important attributes based on the similarity between condition attributes. Theory analysis and the experiment results show that this algorithm reduces the calculation complexity and improves reduction effect.
Keywords:knowledge granularity  attribute similarity  attribute reduction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号