关键词: 粗糙集理论, 离散化, 属性约简, 可辨识矩阵, 不可分辩类, 启发式算法

Abstract: This paper mainly discusses the attributes discretization in Rough Set theory.It begins with the algorithm based on the significance of the attributes value.Then it uses the results of references paper [5],the undistributed class and the significance,meanwhile,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, discretization, attribute reduction, discernibility matrix, undistributed class, a heuristic algorithm