A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.

提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。