基于幂图的属性约简

Attribute reduction based on power graph

针对粗糙集理论中基于差别矩阵的属性约简方法存在的不足,提出一种基于幂图的属性约简算法.首先通过修改样本决策属性值将不相容决策表转化为简化的相容决策表;然后将样本对概念与幂图概念相结合,将基于修正差别矩阵的不相容决策表的属性约简转化为幂图的搜索问题;最后通过实例和实验验证了所提出算法的有效性.

In order to overcome the defect of attribute reduction based on discernibility matrix in the theoretical research of rough sets, an attribute reduction algorithm based on the power graph is proposed. The inconsistent decision tables are converted into consistent decision tables by altering the value of decision attribute. Combined with the concept of the sample pair and power graph, the attribute reduction of inconsistent decision table based on the revised discernibility matrix is translated into the searching problem in power graph. Finally, the example and experiment show the effectiveness of the proposed algorithm.