×

The investigation of covering rough sets by Boolean matrices. (English) Zbl 1448.68421

Summary: In covering rough set theory, the basic problem is the calculation of lower and upper approximations for subsets of a covering approximation space. For a covering approximation space with a large cardinal, using definitions to calculate approximations would be tedious and complicated. So it is important to investigate matrix methods by which calculations will become algorithmic and can be easily implemented by computers. Since the covering in a covering approximation space can be represented by a Boolean matrix, every covering rough approximation operator must be closely related to this matrix. In this paper, we investigated 32 pairs of neighborhood-based dual lower and upper approximation operators and successfully obtained all the matrix representations of them. Some examples were presented in the manuscript to illustrate how to use matrix methods to compute lower and upper approximations and examples were also given to solve the inverse problem, i.e., finding all the subsets whose lower or upper approximation is a given subset.

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
03E72 Theory of fuzzy sets, etc.
15B34 Boolean and Hadamard matrices
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bonikowski, Z.; Brynarski, E., Extensions and intentions in rough set theory, Inf. Sci., 107, 149-167, (1998)
[2] 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, Inf. Sci., 177, 3500-3518, (2007) · Zbl 1122.68131
[3] Couso, I.; Dubois, D., Rough sets, coverings and incomplete information, Fundam. Inform., 108, 223-247, (2011) · Zbl 1279.68308
[4] Lin, G. P.; Li, J. J., A covering-based pessimistic multigranulation rough set, (Proceedings of the Seventh International Conference on Intelligent Computing, LNBI, vol. 6840, (2012)), 673-680
[5] Liu, C. H.; Miao, D. Q., Covering rough set model based on multi-granulations, (Proceedings of the Thirteenth International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, LNCS (LNAI), vol. 6743, (2011)), 87-90
[6] Liu, G. L., The axiomatization of the rough set upper approximation operations, Fundam. Inform., 69, 3, 331-342, (2006) · Zbl 1096.68150
[7] Liu, G. L.; Sai, Y., A comparison of two types of rough sets induced by coverings, Int. J. Approx. Reason., 50, 521-528, (2009) · Zbl 1191.68689
[8] Ma, L. W., On some types of neighborhood-related covering rough sets, Int. J. Approx. Reason., 53, 901-911, (2012) · Zbl 1246.03068
[9] Ma, L. W., Classification of coverings in the finite approximation spaces, Inf. Sci., 276, 31-41, (2014) · Zbl 1347.54019
[10] Ma, L. W., Two fuzzy covering rough set models and their generalizations over fuzzy lattices, Fuzzy Sets Syst., 294, 1-17, (2016) · Zbl 1374.03049
[11] Pawlak, Z., Rough sets, Int. J. Comput. Inf. Sci., 11, 341-356, (1982) · Zbl 0501.68053
[12] Pedrycz, W., Granular computing: analysis and design of intelligent systems, (2013), CRC Press/Francis Taylor Boca Raton
[13] Pedrycz, W.; Syed Ahmad, S. S., Evolutionary feature selection via structure retention, Expert Syst. Appl., 39, 11801-11807, (2012)
[14] Pei, Z.; Pei, D. W.; Li, Z., Topology vs generalized rough sets, Int. J. Approx. Reason., 52, 231-239, (2011) · Zbl 1232.03044
[15] Pomykala, J. A., Approximation operators in approximation space, Bull. Pol. Acad. Sci., Math., 35, 653-662, (1987) · Zbl 0642.54002
[16] Qin, K. Y.; Gao, Y.; Pei, Z., On covering rough sets, (Proceedings of the Second International Conference on Rough Sets and Knowledge Technology, LNCS (LNAI), vol. 4481, (2007)), 34-41
[17] Restrepo, M.; Cornelis, C.; Gómez, J., Partial order relation for approximation operators in covering based rough sets, Inf. Sci., 284, 44-59, (2014) · Zbl 1355.68257
[18] Samanta, P.; Chakraborty, M. K., Covering based approaches to rough sets and implication lattices, (Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, vol. 5908, (2009)), 127-134
[19] Shi, Z. H.; Gong, Z. T., The further investigation of covering-based rough sets: uncertainty characterization, similarity measure and generalized models, Inf. Sci., 180, 3745-3763, (2010) · Zbl 1205.68430
[20] Wang, J.; Dai, D.; Zhou, Z., Fuzzy covering generalized rough sets, J. Zhoukou Norm. Univ., 21, 2, 20-22, (2004), (in Chinese)
[21] Wang, S. P.; Zhu, W.; Zhu, P. Y., Poset approaches to covering-based rough sets, (Proceedings of the Fifth International Conference on Rough Sets and Knowledge Technology, LNCS (LNAI), vol. 6401, (2010)), 25-29
[22] Wang, S. P.; Zhu, W.; Zhu, Q. H.; Min, F., Characteristic matrix of covering and its application to Boolean matrix decomposition and axiomatization, Inf. Sci., 263, 186-197, (2014) · Zbl 1328.68232
[23] Wybraniec-Skardowska, U., On a generalization of approximation space, Bull. Pol. Acad. Sci., Math., 37, 51-61, (1989) · Zbl 0755.04011
[24] Xu, W. H.; Zhang, W. X., Measuring roughness of generalized rough sets induced by a covering, Fuzzy Sets Syst., 158, 2443-2455, (2007) · Zbl 1127.68106
[25] Xu, Z.; Wang, Q., On the properties of covering rough sets model, J. Henan Norm. Univ., 33, 1, 130-132, (2005), (in Chinese) · Zbl 1091.03509
[26] Yao, Y. Y., Relational interpretations of neighborhood operators and rough set approximation operators, Inf. Sci., 111, 239-259, (1998) · Zbl 0949.68144
[27] Yao, Y. Y.; Yao, B. X., Covering based rough set approximations, Inf. Sci., 200, 91-107, (2012) · Zbl 1248.68496
[28] Yun, Z. Q.; Ge, X.; Bai, X. L., Axiomatization and conditions for neighborhoods in a covering to form a partition, Inf. Sci., 181, 1735-1740, (2011) · Zbl 1216.68299
[29] Zakowski, W., Approximations in the space \((U, \operatorname{\Pi})\), Demonstr. Math., 16, 761-769, (1983) · Zbl 0553.04002
[30] Zhang, J.; Li, T.; Ruan, D.; Liu, D., Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations, Inf. Sci., 329, 287-302, (2016) · Zbl 1390.68687
[31] Zhang, Y. L.; Luo, M. K., On minimization of axiom sets characterizing covering-based approximation operators, Inf. Sci., 181, 3032-3042, (2011) · Zbl 1216.68300
[32] Zhu, P.; Wen, Q. Y., Entropy and co-entropy of a covering approximation space, Int. J. Approx. Reason., 53, 528-540, (2012) · Zbl 1246.68237
[33] Zhu, W., Relationship between generalized rough sets based on binary relation and covering, Inf. Sci., 179, 210-225, (2009) · Zbl 1163.68339
[34] Zhu, W., Topological approaches to covering rough sets, Inf. Sci., 177, 6, 1499-1508, (2007) · Zbl 1109.68121
[35] Zhu, W.; Wang, F. Y., Reduction and axiomization of covering generalized rough sets, Inf. Sci., 152, 217-230, (2003) · Zbl 1069.68613
[36] Zhu, W.; Wang, F., On three types of covering based rough sets, IEEE Trans. Knowl. Data Eng., 19, 8, 1131-1144, (2007)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.