Computer Engineering and Applications ›› 2007, Vol. 43 ›› Issue (21): 168-169.

• 数据库与信息处理 • Previous Articles     Next Articles

Approach and Dephi programing for attribution

ZHU Xing-dong,FAN Min   

  1. Department of System Science and Applied Mathematics,Kunming University of Science and Technology,Kunming 650093,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-07-21 Published:2007-07-21
  • Contact: ZHU Xing-dong


朱兴东,范 敏   

  1. 昆明理工大学 系统理论与应用数学系,昆明 650093
  • 通讯作者: 朱兴东

Abstract: This paper mainly discusses the attribute reduction in Rough Set theory.It begins with the methods of core set searching,then uses the results of references paper[5],the undistributed class and the significance,meanwhile,gives the definition of discernibility sub-matrix which proposing a heuristic algorithm based on General core set for attribute reduction;finally,the experiment shows that it can get better effect and it also shows the reduction results of UCI database using this algorithm.

Key words: Rough Set theory, attribute reduction, discernibility matrix, discernibility sub-matrix, undistributed class, General core set

摘要: 主要对Rough Set理论中的属性约简问题进行了研究,从寻找属性约简的两个角度出发,利用文献[5]中不可分辩类的定义及属性重要性的讨论,通过定义子集可辨识矩阵Ms(i,j)构造了一种广义核的启发式算法,并通过Delphi程序验证了该算法对实例和UCI数据库的有效性。

关键词: 粗糙集理论, 属性约简, 可辨识矩阵, 子集可辨识矩阵, 不可分辩类, 广义核, 启发式, ,