Minimal Description and Maximal Description in Covering-based Rough Sets

• Autorzy: Wang Z. , Shu L. , Ding X.
• Języki publikacji: EN

Abstrakty

EN

Rough set theory is an important technique in knowledge discovery in databases. In covering-based rough sets, seven types of rough set models were established in recent years. This paper defines the concept of maximal description of an element, and further explores the properties and structures of several types by means of the concepts of maximal description and minimal description. Finally, we study the relationship between covering-based rough sets and the generalized rough sets based on binary relation.

Słowa kluczowe

EN

coverings; data mining; granular computing; maximal descriptions; rough sets

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2013
• Tom: Vol. 128, nr 4
• Strony: 503--526
• Opis fizyczny: Bibliogr. 42 poz.

Twórcy

autor

Wang Z.

• College of Mathematics and Computer Science, Shanxi Normal University, Linfen, 041004, P.R.China

autor

Shu L.

• School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, P.R.China

autor

Ding X.

• School of Mathematical Sciences, University of Electronic Science and Technology of China, Chengdu, 611731, P.R.China

Bibliografia

• [1] Pawlak, Z.: Rough sets, International Journal of Computer and Information Science, 11(5), 1982, 341-356.
• [2] Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Boston, 1991.
• [3] Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U. : Extensions and intentions in the rough set theory, Information Sciences, 107, 1998, 149-167.
• [4] Liu, G. L. : The axiomatization of the rough set upper approximation operations, Fundamenta Informaticae, 69(23), 2006,331-342.
• [5] Pawlak, Z., Skowron, A.: Rudiments of rough sets, Information Sciences, 177 (1), 2007, 3-27.
• [6] Pomykala, J. A. : Approximation operations in approximation space, Bulletin of the Polish Academy of Sciences, 35 (9-10), 1987, 653-662.
• [7] Yao, Y. Y.: Constructive and algebraic methods of theory of rough sets, Information Sciences, 109, 1998, 21-47.
• [8] Zakowski, W.: Approximations in the space (u, n), Demonstratio Mathematica, 16, 1983, 761-769.
• [9] Zhang, H., Liang, H., Liu, D. : Two new operators in rough set theory with applications to fuzzy sets, Information Sciences, 166, 2004, 147-165.
• [10] Bazan, J. : A View on Rough Set Concept Approximations, Fundamenta Informaticae, 59, 2004,107-118.
• [11] Zhu, W., Wang, F. Y. : Reduction and axiomization of covering generalized rough sets, Information Sciences, 152, 2003,217-230.
• [12] Swiniarski, R. W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters, 24(6), 2003, 833-849.
• [13] Lin, T. Y, Cercone, N. (Eds.): Rough Sets and Data Mining, Kluwer Academic Publishers, Boston, 1997.
• [14] Polkowski, L., Skowron, A. (Eds.): Rough Sets and Current Trends in Computing, Vol. 1424, Springer, Berlin, 1998.
• [15] Polkowski, L., Skowron, A. (Eds.): Rough Sets in Knowledge Discovery, Vol. 1 and 2, Physica-Verlag, Heidelberg, 1998.
• [16] Ślęzak, D., Synak, P., Borkowski, J., Wrblewski, J., Toppin, G.: A Rough-columnar RDBMS Engine-A Case Study of Correlated Subqueries. IEEE Data Engineering Bulletin, 35(1), 2012, 34-39.
• [17] Stepaniuk, J.: Relational data and rough sets, Fundamenta Informaticae, 79, 2007, 525-539.
• [18] Ziarko, W., (Eds.): Rough Sets, Fuzzy Sets, and Knowledge Discovery, Springer-Verlag, Berlin, 1994.
• [19] Slowinski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, 12 (2), 2000, 331-336.
• [20] Cornelis, C., Jensen, R., Hurtado, G., Ślęzak, D.: Attribute selection with fuzzy decision reducts, Information Sciences, 108(2), 2010, 209-224.
• [21] Cattaneo, G., Ciucci, D.: Algebraic structures for rough sets, Lecture Notes in Computer Science, 3135, 2004, 208-252.
• [22] Meng, Z., Shi, Z.: A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets, Infomation Sciences, 179 (16), 2009, 2774-2793.
• [23] Skowron, A., Stepaniuk, J.: Tolerance approximation spaces, Fundamenta Informaticae, 27, 1996, 245-253.
• [24] Kondo, M.: On the structure of generalized rough sets, Infomation Sciences, 176 (5), 2005, 589-600.
• [25] Liu, G. L., Zhu, W.: The algebraic structures of generalized rough set theory, Infomation Sciences, 178 (21), 2008, 4105-4113.
• [26] Yao, Y. Y.: Relational interpretations of neighborhood operators and rough set approximation operators, Infomation Sciences, 111, 1998, 239-259.
• [27] Zhu, W.: Generalized rough sets based on relations, Infomation Sciences, 177 (22), 2007, 4997-5011.
• [28] Bryniarski, E.: A calculus of rough sets of the first order, Bulletin of the Polish Academy of Sciences, 36 (16), 1989, 71-77.
• [29] Zhu, W., Wang, F. Y.: A new type of covering rough sets, in: IEEE IS 2006, London, 4-6 September, 2006, 444-449.
• [30] Zhu, W.: Relationship between generalized rough sets based on binary relation and covering, Infomation Sciences, 179, 2009, 210-225.
• [31] Xu, W. H., Zhang, W. X.: Measuring roughness of generalized rough sets induced by a covering, Fuzzy Sets and Systems, 158, 2007, 2443-2455.
• [32] Liu, G., Sai, Y: A comparison of two types of rough sets induced by coverings, International Journal of Approximate Reasoning, 50, 2009, 521-528.
• [33] Zhu, W.: Relationship among basic concepts in covering-based rough sets, Information Sciences, 179, 2009, 2478-2486.
• [34] Zhu, W., Wang, F. Y.: On three types of covering rough sets, IEEE Transactions Knowledge and Data Engineering, 19 (8), 2007, 1131-1144.
• [35] Ślęzak, D., Wasilewski, P.: Granular sets - foundations and case study of tolerance spaces, Proc. RSFDGrC 2007, Lecture Notes in Computer Science 4482, Springer, Berlin, 2007.
• [36] Yang, T., Li, Q.: Reduction about approximation spaces of covering generalized rough sets, International Journal of Approximation Reasoning, 51, 2010, 335 - 345.
• [37] Chen, D., Wang, C., Hu, Q.: A new approach to attributes reduction of consistent and inconsistent covering decision systems with covering rough sets, Information Sciences, 177, 2007, 3500-3518.
• [38] Hu, Q. H., Yu, D. R., Liu, J. F., Wu, C. X.: Neighborhood rough set based heterogeneous feature subset selection, Information Sciences, 178, 2008, 3577-3594.
• [39] Kondo, M.: Algebraic approach to generalized rough sets, Lecture Notes in Artificial Intelligence, 3641, 2005, 132-140.
• [40] Yao, Y. Y, Lin, T. Y.: Generalization of rough sets using modal logic, Intelligent Automation and Soft Computing, 2, 1996, 103-120.
• [41] Yao, Y Y.: Two views of the theory of rough sets in finite universes, International Journal of Approximate Reasoning, 15, 1996, 291-317.
• [42] Liu, G. L.: The axiomatization of the rough set upper approximation operations, Fundamenta Informaticae, 69, 2006, 331-342.