关键词: 粗糙集, 布尔冲突矩阵, 启发函数, 属性约简

Abstract: In recent years, many scholars like to use the method of the discernibility matrix to design attribute reduction algorithm, but due to the calculation of the discernibility matrix not only time-consuming but also a waste of space, resulting that these attribute reduction algorithms are not good enough. In order to reduce the complexity of attribute reduction algorithm, this paper defines a heuristic function on the basis of Boolean conflict matrix, which can measure the number of conflicts of the condition attribute in the decision table and gives a fast algorithm of the heuristic function at the same time. Then, it designs an effective attribute reduction algorithm of the incomplete table based on the improved Boolean conflict matrix with the heuristic function, and the algorithm can effectively reduce the time complexity. Finally, the experimental results show that the new algorithm is effective.

Key words: rough set, Boolean conflict matrix, heuristic function, attribute reduction