华东师范大学学报(自然科学版) ›› 2018, Vol. 2018 ›› Issue (3): 97-108,156.doi: 10.3969/j.issn.1000-5641.2018.03.011

• 计算机科学 • 上一篇    下一篇

近似边界精度信息熵的属性约简

梁宝华1,2, 吴其林1,2   

  1. 1. 巢湖学院 信息工程学院, 合肥 238000;
    2. 巢湖学院 网络与分布式研究所, 合肥 238000
  • 收稿日期:2017-04-21 出版日期:2018-05-25 发布日期:2018-05-29
  • 作者简介:梁宝华,男,硕士,副教授,研究方向为粗糙集、数据挖掘.E-mail:liangbh426@126.com;吴其林,男,博士,副教授,主要研究方向为无线网络.E-mail:lingqiw@126.com.
  • 基金资助:
    安徽省自然科学基金（1308085MF101）；安徽省高校自然科学重点研究项目（KJ2016A502）；安徽省高校优秀青年国内外访学研修项目（gxfx2017100）

Attribute reduction based on information entropy of approximation boundary accuracy

LIANG Bao-hua1,2, WU Qi-lin1,2   

  1. 1. College of Information Engineering, Chaohu University, Hefei 238000, China;
    2. Institute of Networks and Distributed System, Chaohu University, Hefei 238000, China
  • Received:2017-04-21 Online:2018-05-25 Published:2018-05-29

RichHTML

13

PDF

529

摘要： 针对信息观只考虑知识粒度的大小，不能客观、全面度量属性重要性的不足，首先从代数观出发，提出近似边界精度的定义；其次，根据相对模糊熵的定义，提出相对信息熵及增强信息熵概念，与相对模糊熵相比具有明显的放大作用；再次，将近似边界精度融合相对信息熵和增强信息熵，提出两种新的属性约简方法，在求U/（B∪b）时充分利用U/B的结果，可大大减少系统的时间开销；最后，通过实验分析和比较，本文算法在约简质量、分类精度上的可行性和有效性得到了验证.

关键词: 粗糙集, 属性约简, 近似边界精度, 相对信息熵, 增强信息熵

Abstract: From an information point of view, only the size of knowledge granularity is taken into account, while the importance of attributes cannot be objectively and comprehensively measured. First, starting from the perspective of algebra, the concept of approximate boundary accuracy is proposed. Afterwards, according to the definition of relative fuzzy entropy, this paper proposes two new concepts for relative information entropy and enhanced information entropy. Compared with relative fuzzy entropy, the proposed information entropy has an obvious magnification effect. Two new methods of attribute reduction are subsequently proposed by incorporating approximate boundary accuracy into relative information entropy and enhanced information entropy. Computing U/(B∪b) while making full use of U/B can greatly reduce the computational overhead on time. Finally, through the experimental analysis and comparison, it is validated that the proposed algorithm has feasibility and effectiveness in both reduction quality and classification accuracy.

Key words: rough set, attribute reduction, approximation boundary accuracy, relative information entropy, enhanced information entropy

中图分类号: