计算机工程 ›› 2007, Vol. 33 ›› Issue (11): 7-9.doi: 10.3969/j.issn.1000-3428.2007.11.003

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

基于粗糙集的快速属性约简算法研究

瞿彬彬,卢炎生   

  1. (华中科技大学计算机科学与技术学院,武汉 430074)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-06-05 发布日期:2007-06-05

Fast Attribute Reduction Algorithm Based on Rough Sets

QU Binbin, LU Yansheng   

  1. (College of Computer Science & Technology, Huazhong University of Science & Technology, Wuhan 430074)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-06-05 Published:2007-06-05

摘要: 通过分析现有相容决策表属性约简算法,找出了计算低效性的根源。新的约简算法从论域的角度出发,采用层次结构,用属性边界域作为度量属性重要性启发函数。该算法使得论域不断缩小的同时,又能选出反映决策表系统特征的重要属性。理论分析和实验表明,该算法保证在分类精度不变的前提下,获得最优或次优的约简属性集。

关键词: 粗糙集, 层次约简, 属性重要度

Abstract: Through analysing the attribute reduction algorithms of consistent decision table, reasons of inefficiency are found. A new algorithm is proposed which adopts hierarchy structure and boundary of attribute as heuristic function to choose the essential attribute. It can select the important attributes that reflect the characteristic of system while the universal is decreasing. Theoretical analysis and experiment results show that on the premise of unchanged of classification precision, the algorithm can obtain the best or sub-best attribute reduce set.

Key words: Rough set, Hierarchy reduction, Significance of attributes

中图分类号: