The research of knowledge granularity has been a hotspot at home and abroad. In incomplete information systems of the rough set, we give a formula, which calculates the attribute frequency directly without acquiring the discernibility matrix. Then applying it to the field of knowledge granularity, we give a quick calculation of the attribute reduction algorithm, which of the time complexity is O(|C|2 |U |) in the worst case. The example result shows that the algorithm is correct and efficient.
展开▼
机译：知识粒度的研究一直是国内外的一个热点。在粗糙集的不完备信息系统中，我们给出一个公式，该公式无需获取可分辨矩阵即可直接计算属性频率。然后将其应用于知识粒度领域，我们可以快速计算出属性约简算法，在最坏的情况下，其时间复杂度为O（| C | 2 | U |）。实例结果表明，该算法是正确有效的。
展开▼
