粗集中不可分辨类算法求解实现

Realization about Algorithm of Indiscernibility Relation in Rough Sets

从原始信息系统出发,用不可分辨类的思想求解系统的核属性和约简是粗集理论的精华。因此,如何在计算机上实现这种思想关系到读者对粗集理论抽象概念的理解。文中利用MATLAB语言编程实现了不可分辨类算法。考虑该语言的特点,首先将原始信息系统转换为数字型矩阵,然后自定义用户函数attvalist,并结合MATLAB语言中丰富的矩阵与向量运算函数,不经复杂的编程完成了样本分类。

Finding the core(s) and the reduction of information system is prime of rough sets by the method of indiscernibility relation from origin information system. It is helpful for readers to understand the abstract notion of rough sets after the algorithm is put into the program. The algorithm was programmed by MATLAB in this paper. Because MATLAB has large rich functions about matrixes and sectors, the information system must be changed into numerical matrixes. Then the function of attvallist was defined. Using the abundant functions such as UDF or inner function, the algorithm of indiscernibility relation was realized.