关键词: 粗糙集, 正区域, 决策差别矩阵, 核属性

Abstract: Computing core attributes is one of the important research problems in rough sets theory. To overcome the shortcomings of computing core attributes based on discernibility matrix, the definition of decision discernibility matrix and method of dividing decision table are put forward. The methods of creating sub-decision discernibility matrix on sub-decision table and computing core attribute are presented, and it is proved that the core attribute is equivalent to the one based on positive region. The serial and parallel algorithms for computing core attribute based on horizontally partitioned decision table are designed. Both of the example analysis and experiment results show that the computing core algorithms proposed are correct and efficient.

Key words: rough set, positive region, decision discernibility matrix, core attributes