计算机工程与应用 ›› 2012, Vol. 48 ›› Issue (36): 31-33.

• 博士论坛 • 上一篇    下一篇

一种基于知识粒度的启发式属性约简算法

马福民1,张腾飞2   

  1. 1.南京财经大学 信息工程学院,南京 210046
    2.南京邮电大学 自动化学院,南京 210046
  • 出版日期:2012-12-21 发布日期:2012-12-21

New heuristic algorithm for attribute reduction based on knowledge granularity

MA Fumin1, ZHANG Tengfei2   

  1. 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
  • Online:2012-12-21 Published:2012-12-21

摘要: 属性约简是粗糙集理论进行知识获取的核心问题之一。根据属性相似度与知识粒度的一致性,通过条件属性与决策属性以及条件属性之间的相似度度量,提出了一种基于知识粒度的启发式属性约简算法。根据条件属性与决策属性的相似度对条件属性进行降序排列,根据条件属性之间的相似度度量选择重要的属性,从而得到约简集合。理论分析与实验结果表明,该算法具有较高的运行效率和较好的约简效果。

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

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.

Key words: knowledge granularity, attribute similarity, attribute reduction