一种信息系统求核的新方法

A new algorithm for a core with information system

为简化用差别矩阵求核的计算方法,给出了差别矩阵与核关系的定理,并在此基础上给出了一种新的求核方法.新算法从差别矩阵中直接提取出核属性元素并利用该定理的结论给出信息系统中核的构成.经计算,该算法的复杂度为O(n2m).

Based on rough sets theory, an approach to the properties of discernibility matrix and the algorithm to get core of an information system are presented. The relationship between discernibility matrix and core of an information system is discussed. By employing the result of the theorem given, a new algorithm for the computation of a core is proposed. The complexity of the new algorithm is ( O(n^2m ).)