计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (20): 164-167.DOI: 10.3778/j.issn.1002-8331.2010.20.046

• 人工智能 • 上一篇    下一篇

一种快速差别矩阵属性约简算法

吕 萍1,钱 进1,2,王 波3,谢 峰3   

  1. 1.江苏技术师范学院 计算机工程学院,江苏 常州 213001
    2.同济大学 计算机科学与技术系,上海 201804
    3.江苏技术师范学院 教务处,江苏 常州 213001
  • 收稿日期:2010-04-14 修回日期:2010-05-17 出版日期:2010-07-11 发布日期:2010-07-11
  • 通讯作者: 吕 萍

Fast attribute reduction algorithm based on discernibility matrices

LV Ping1,QIAN Jin1,2,WANG Bo3,XIE Feng3   

  1. 1.Institute of Computer Engineering,Jiangsu Teachers University of Technology,Changzhou,Jiangsu 213001,China
    2.Department of Computer Science and Technology,Tongji University,Shanghai 201804,China
    3.Academic Administration Office,Jiangsu Teachers University of Technology,Changzhou,Jiangsu 213001,China
  • Received:2010-04-14 Revised:2010-05-17 Online:2010-07-11 Published:2010-07-11
  • Contact: LV Ping

摘要: 为了解决基于差别矩阵属性约简的计算效率问题,分析了基于差别矩阵的属性约简算法的不足,给出了新的差别矩阵的定义,大大减少了差别矩阵中非空元素的个数,提高了属性约简算法的效率。利用单个属性的不可辨识性来计算出现频率最多的属性,进一步降低差别矩阵的大小,并设计了基于新的差别矩阵的快速属性约简算法。对UCI一些数据库进行了仿真,实验结果表明了新算法具有高效性。

关键词: 粗糙集, 属性约简, 差别矩阵, 不一致决策表

Abstract: In order to solve the efficiency problem of calculating the attribute reduction based on discernibility matrices,the shortcomings of attribution reduction algorithm are analyzed based on discernibility matrices,and the definition of the new discernibility matrices is presented.It decreases greatly the number of non-empty elements,which improves the efficiency of algorithm for attribute reduction based on discernibility matrices.And an attribute with indiscernibility can be used to compute the attribute with more frequencies for generating smaller discernibility matrices.A new algorithm based on the improved discernibility matrices is proposed.An example is used to illustrate the efficiency of the new algorithm.The simulation experiments for UCI databases show that the new algorithm is efficient for various kinds of data sets.

Key words: rough set, attribute reduction, discernibility matrices, inconsistent decision table

中图分类号: