A quick attribute reduction algorithm based on knowledge granularity

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|
²
|U |) in the worst case. The example result shows that the algorithm is correct and efficient.