Abstract：A covering reduction algorithm is studied under condition that both the upper approximation operator and the under approximation operator are not changed. The absolute information quantity and information quantity are defined, and then the adjacency matrix is presented. An incremental reduction algorithm is presented for covering generalized rough sets which based on the absolute information quantity. The example shows that the proposed algorithm method is an effective technique to remove the redundant knowledge in the complex data sets.
林国平, 李进金. 基于绝对信息量的覆盖增量约简算法[J]. 模式识别与人工智能, 2011, 24(2): 210-214.
LIN Guo-Ping, LI Jin-Jin. A Covering Incremental Reduction Algorithm Based on Absolute Information Quantity. , 2011, 24(2): 210-214.
2011, Vol. 24 
