Attribute Reduction Using Extension of Covering Approximation Space

• Autorzy: Wang, G.Y. , Hu, J.
• Języki publikacji: EN

Abstrakty

EN

The concept of the complement of a covering is introduced, and then the extended space of a covering approximation space is induced based on it. Generally, the extended space of a covering approximation space generates a bigger covering lower approximation or smaller covering upper approximation than itself. Through extending each covering of a covering decision system, the classification ability of each covering may be improved. Thus, a heuristic reduction algorithm is developed to eliminate some coverings in a covering decision system without decreasing the classification ability of the system for decision. Theoretical analysis and experimental results indicate that this algorithm can often get smaller reduction than other algorithms.

Słowa kluczowe

EN

coverings; rough sets; covering decision system; attribute reduction

• Czasopismo: Fundamenta Informaticae
• Rocznik: 2012
• Tom: Vol. 115, nr 2/3
• Strony: 219-232
• Opis fizyczny: Bibliogr. 31 poz., wykr.

Twórcy

autor

Wang, G.Y.

autor

Hu, J.

• Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing, P. R. China, 400065,

Bibliografia

• [1] Pawlak, Z.: Rough set. International Journal of Computer and Information Sciences. 11(1982)341-356
• [2] Polkowski, L., Skowron, A., Zytkow, J.: Rough foundations for rough sets, in Proceedings of The Third International Workshop on Rough Sets and Soft Computing (RSSC'94), San Jose State University, CA, November 10-12, (1994) 142-149
• [3] Skowron, A., Stepaniuk, J.: Generalized approximation spaces, in Proceedings of The Third International Workshop on Rough Sets and Soft Computing (RSSC'94), San Jose State University, CA, November 10-12, (1994) 156-163
• [4] Skowron, A.: Tolerance approximation spaces, Fundamenta Informaticae, 27(2-3) (1996) 245-253
• [5] Kryszkiewicz, M.: Rough set approach to incomplete information systems, Information Sciences, 112(1998)39-49
• [6] Slowinski, R., Vsnderpooten, D.: A generalized definition of rough approximations based on similarity, IEEE Tansactions on Knowledge and Data Engineering, 12(2000)331-326
• [7] Wang, G.Y.: Extension of rough set under incomplete information systems, Journal of Computer Research and Development, 39(2002)1238-1243
• [8] Yao, Y.Y.: On generalizing rough set theory, in Proceedings of the 9th International Conference Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2003), LNAI 2639, (2003) 44-51
• [9] Zhu, W.: Generalized rough sets based on relations, Information Sciences, 177(2007)4997-5011
• [10] Zakowski,W.: Approximation in the space (U,_), Demonstratio Mathematica, 16(1983)761-769
• [11] Bonikowski, Z., Bryniarski, E.,Wybraniec, U.: Extensions and intentions in the rough set theory, Information Sciences, 107(1998)149-167
• [12] Tsang, E.C.C., Chen, D.G., Lee, J.W.T., Yeung, D.S.: On the upper approximations of covering generalized rough sets, in 3rd International Conference Machine Learning and Cybermetics. Shanghai, China, (2004)4200-4203
• [13] Zhu, W., Wang, F.Y.: A new type of covering rough set, in 3rd International IEEE Conference Intelligent Systems. London, (2006)444-449
• [14] Zhu, W.: Topological approaches to covering rough sets, Information Sciences, 177(2007)1499-1508
• [15] Zhu, W., Wang, F.Y.: On three types of covering-based rough sets, IEEE Transactions on Knowledge and Data Engineering, 19(2007)1131-1144
• [16] Zhu, W., Wang, F.Y.: Reduction and axiomization of covering generalized rough sets, Information Sciences, 152(2003)217-230
• [17] Hu, J.,Wang, G.Y.: knowledge reduction of covering approximation space, Transction on Computer Science, 5540(2009)69-80
• [18] Huang, B., He, X., Zhou, X.Z.: Rough entropy based on generalized rough sets covering reduction, Journal of Software, 15(2004)215-220
• [19] Xu, W.H., Zhang, W.X.: Measuring roughness of generalized rough sets induced by a covering, Fuzzy sets and systems, 158(2007)2443-2455
• [20] Hu, J., Wang, G.Y.: Fuzziness of covering based generalized rough sets, Chongqing University of Posts and telecommunications, 21(2009) 490-493
• [21] Wierman, M.J.: The lattice of covers and partitions of a finite set under rough exact ordering. in Proceedings JEIS'98. 1998. 52-55
• [22] Hu, J., Wang, G.Y.: Hierarchical model of covering granular space, Journal of NanJing University (Natural Science), 44(2008)551-558
• [23] Wei, L., Miao, D. Q., Xu, F. F. and Xia, F. C.: Research on a covering rough fuzzy set model, Journal of Computer Research and Development, 43 ( 2006) 1719-1723
• [24] Xu, Z. Y. and Liao, J. Q.: On the covering fuzzy rough sets model, Fuzzy Systems and Mathematics, 20 (2006) 141-144
• [25] Hu, J., Wang, G.Y., Zhang, Q.H.: Covering based generalized rough fuzzy set model, Journal of Software, 21 (2010) 968-977
• [26] Wang, G.Y.: Rough set theory and knowledge acquisition. Xi'an: Xi'an Jiaotong University Press, 2001
• [27] Chen, D.G., Wang, C.Z., Hu, Q.H.: A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Information Sciences, 177(2007)3500-3518
• [28] Li, F., Yin, Y.Q.: Approaches to knowledge reduction of covering decision systems based on information theory, Information Sciences, 179(2009)1694-1704
• [29] Delimata, P., Moshkov, M., Skowron, A., Suraj, Z.: Lazy classification algorithms based on deterministic and inhibitory Rules. In Twelve International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2008). Torremolinos, (2008) 1773-1778.
• [30] Jankowski, A., Peters, J.F., Skowron, A., Stepaniuk, J.: Optimization in discovery of compound granules. Fundamenta Informaticae, 85(2008) 1-17
• [31] Skowron, A., Stepaniuk, J., Swiniarski, R.: Approximation spaces in rough-granular computing. Fundamenta Informaticae, 100(2010) 141-157