Abstract 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.
[1] Zakowski W. Approximation in the Space (U,Π). Demonstratio Mathematica, 1983, 16: 761-769 [2] Bonikowski Z, Bryniarski E, Wybraniec U. Extensions and Intentions in the Rough Set Theory. Information Sciences, 1998, 107(1/2/3/4): 149-167 [3] Bonikowski Z. Algebraic Structures of Rough Sets in Representative Approximation Spaces. Electronic Notes in Theoretical Computer Science, 2003, 82(4): 52-63 [4] Bryniaski E. A Calculus of Rough Sets of the First Order. Bulletin of the Polish Academy of Sciences, 1987, 37(16): 71-77 [5] Pomykala J A. Approximation Operations in Approximation Space. Bulletin of the Polish Academy of Sciences, 1987, 35(9/10): 653-662 [6] Zhu W, Wang Feiyue. Reduction and Axiomization of Covering Generalized Rough Sets. Information Sciences, 2003, 152(1): 217-230 [7] Zhu W. Topological Approaches to Covering Generalized Rough Sets. Information Sciences, 2007, 177(6): 1499-1508 [8] Chen Degang, Wang Changzhong, Hu Qinghua. A New Approach to Attribute Reduction of Consistent and Inconsistent Covering Decision Systems with Covering Rough Sets. Information Sciences, 2007, 177(17): 3500-3518 [9] Li Jinjin. Topological Methods on the Theory of Covering Generalized Rough Sets. Pattern Recognition and Artificial Intelligence, 2004, 17(1): 7-10 (in Chinese) (李进金.覆盖广义粗集理论中的拓扑学方法. 模式识别与人工智能, 2004, 17(1): 7-10) [10] Zhang Wenxiu, Mi Jusheng, Wu Weizhi. Approaches to Knowledge Reductions in Inconsistent Systems. International Journal of Intelligent Systems, 2003, 18(9): 989-1000 [11] Qian Yuhua, Liang Jiye, Pedrycz W, et al. Positive Approximation: An Accelerator for Attribute Reduction in Rough Set Theory. Artificial Intelligence, 2010, 174(9/10): 597-618 [12] Huang Bing, He Xin, Zhou Xianzhong. Rough Entropy Based on Generalized Rough Sets Covering Reduction. Journal of Software, 2004, 15(2): 215-220 (in Chinese) (黄 兵,何 新,周献中.基于广义粗集覆盖约简的粗糙熵.软件学报, 2004, 15(2): 215-220) [13] Qian Yuhua, Liang Jiye, Li Deyu, et al. Measures for Evaluating the Decision Performance of a Decision Table in Rough Set Theory. Information Sciences, 2008, 178(1): 181-202 [14] Wang Guoying, Yao Yiyu, Yu Hong. A Survey on Rough Set Theory and Applications. Chinese Journal of Computers, 2009, 32(7): 1229-1246 (in Chinese) (王国胤,姚一豫,于洪.粗糙集理论与应用研究综述.计算机学报, 2009, 32(7): 1229-1246) [15] Zhu Feng, Wang Feiyue. Some Results on the Covering Generalized Rough Sets. Pattern Recognition and Artificial Intelligence, 2002, 15(1): 6-13 (in Chinese) (祝 峰,王飞跃.关于覆盖广义粗集的一些基本结果.模式识别与人工智能, 2002, 15(1): 6-13) [16] Hu Jun, Zhang Min. Reduction Theory of Covering Approximation Space. Computer Engineering and Applications, 2007, 43(28): 86-88 (in Chinese) (胡 军,张 闽.覆盖近似空间的约简理论.计算机工程与应用, 2007, 43(28): 86-88)
2011, Vol. 24 
