基于绝对信息量的覆盖增量约简算法

摘要

A covering reduction algorithm is studied under the condition that both the upper approximation operator and the under approximation operator are not changed. The absolute information quantity,information quantity and the adjacency matrix are defined. An incremental reduction algorithm is presented based on the absolute information quantity for covering generalized rough sets. The example shows that the proposed algorithm is an effective technique to remove the redundant knowledge in the complex datasets.%在保持覆盖上下近似算子不变的情况下,探讨覆盖约简算法.通过定义绝对信息量和信息量,引人相邻矩阵等概念,提出基于绝对信息量的覆盖增量约简算法.实例表明,该方法是一种能够去除覆盖中绝对冗余知识的有效方法.