基于简化分辨矩阵的粗糙集属性约简算法  

A Simplified-discernibility-matrix-based Algorithm for Attribute Reduction in Rough Set

作　　者：田卫东[1] 周创德[1] 胡学钢[1] 周红鹃[1] 李培培[1] 

机构地区：[1]合肥工业大学计算机与信息学院,合肥230009

出　　处：《计算机科学》2008年第3期209-212,共4页Computer Science

基　　金：安徽省自然科学基金(050420207)

摘　　要：针对改进的经典算法求取属性约简存在的时间和空间性能不理想问题,本文提出了一种新的属性约简算法ARSDM。该算法先将决策表按决策属性的类别划分,后采用边生成矩阵元素边约简边排序的思想求取属性约简,有效地加快了约简速度。实验表明ARSDM算法与经典算法相比具有较好的时间和空间性能。Traditional algorithm has relatively poor efficiency in both time and space when obtaining attribute reduction. Based on SDM, a new algorithm of attribute reduction called ARSDM is proposed in this paper. ARSDM takes the idea of classifying the universe of decision table according to the value of decision attribute firstly, then reducing and sorting elements of SDM while constructing them. The experimental study shows that the algorithm of ARSDM out- performs the traditional algorithms largely on both time and space.

关 键 词：数据挖掘 粗糙集 不一致性决策表 属性约简 分辨矩阵 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] TP311.13[自动化与计算机技术—控制科学与工程]