×

Grained matrix and complementary matrix: novel methods for computing information descriptions in covering approximation spaces. (English) Zbl 07798529

Summary: As two important tools of information descriptions, minimal description (MinD) and maximal description (MaxD) are used to eliminate redundant information when describing an object in covering-based rough sets (CbRSs). Hence, there are many key issues (such as reductions, neighborhoods and approximations) have to do with them in CbRSs. However, it is complicated and time-consuming to use set approaches to compute them in a large cardinal covering approximation space. So the matrix approaches have been used to calculate them by which computers can implement the corresponding calculations easily. Based on the previous research work and inspired by the demand of knowledge discovery under large scale covering information systems, we propose two new matrix methods to calculate MinD and MaxD in CbRSs in this paper. Firstly, a note on the existing methods (matrix approach-1 and approach-2) is presented. Secondly, a new matrix, called grained matrix, is presented. After combining grained matrices and the mean of “sum”, the new matrix approach-1 is presented to calculate MinD and MaxD. Thirdly, three new matrix operations and the notion of complementary matrix are given which can simplify the calculation of computers. Based on new operations, we present the new matrix approach-2 to compute MinD and MaxD. Finally, the computational efficiency of the presented approaches are shown and compared with other methods by experiments on several UCI data sets.

MSC:

68-XX Computer science
65-XX Numerical analysis
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bonikowski, Z.; Bryniarski, E.; Wybraniec-Skardowska, U., Extensions and intentions in the rough set theory, Inf. Sci., 107, 149-167 (1998) · Zbl 0934.03069
[2] Dai, J.; Gao, S.; Zheng, G., Generalized rough set models determined by multiple neighborhoods generated from a similarity relation, Soft. Comput., 12, 1-14 (2017)
[3] Du, Y.; Hu, Q.; Zhu, P.; Ma, P., Rule learning for classification based on neighborhood covering reduction, Inf. Sci., 181, 5457-5467 (2011)
[4] Janicki, R., Yet Another Kind of Rough Sets Induced by Coverings, (Proc. of IJCRS’2017 (International Joint Conference on Rough Sets), Lecture Notes in Artificial Intelligence 10313 (2017)), 140-153 · Zbl 1489.68287
[5] Janicki, R.; Lenarčič, A., Optimal approximations with rough sets and similarities in measure spaces, Int. J. Approximate Reasoning, 71, 1-14 (2016) · Zbl 1352.68245
[6] Lang, G.; Li, Q.; Cai, M.; Yang, T., Characteristic matrixes-based knowledge reduction in dynamic covering decision information systems, Knowl.-Based Syst., 85, 1-26 (2015)
[7] Luo, C.; Li, T.; Yao, Y., Dynamic probabilistic rough sets with incomplete data, Inf. Sci., 417, 39-54 (2017)
[8] Liu, C.; Cai, K.; Miao, D.; Qian, J., Novel matrix-based approaches to computing MinD and MaxD in covering-based rough sets, Inf. Sci., 539, 312-326 (2020) · Zbl 1474.68360
[9] Ma, L., The investigation of covering rough sets by Boolean matrices, Int. J. Approximate Reasoning, 100, 69-84 (2018) · Zbl 1448.68421
[10] Pawlak, Z., Rough sets, Int. J. Comput. Inform. Sci., 11, 341-356 (1982) · Zbl 0501.68053
[11] Pomykala, J. A., Approximation operations in approximation space, Bull. Polish Acad. Sci., 35, 653-662 (1987) · Zbl 0642.54002
[12] Tan, A.; Li, J.; Lin, G.; Lin, Y., Matrix-based set approximations and reductions in covering decision information systems, Int. J. Approximate Reasoning, 59, 68-80 (2015) · Zbl 1328.68230
[13] Tan, A.; Li, J.; Lin, G.; Lin, Y., Fast approach to knowledge acquisition in covering information systems using matrix operations, Knowl.-Based Syst., 79, 90-98 (2015)
[14] Wang, C.; Shi, Y.; Fan, X.; Shao, M., Attribute reduction based on \(\kappa \)-nearest neighborhood rough sets, Int. J. Approximate Reasoning, 106, 18-31 (2019) · Zbl 1456.68190
[15] Wang, S.; Zhu, W.; Zhu, Q.; Min, F., Characteristic matrix of covering and its application to Boolean matrix decomposition, Inf. Sci., 263, 186-197 (2014) · Zbl 1328.68232
[16] Wang, J.; Zhu, W., Applications of bipartite graphs and their adjacency matrices to covering-based rough sets, Fundamenta Informaticae, 156, 237-254 (2017) · Zbl 1381.68293
[17] Wang, J.; Zhang, X., Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets, Int. J. Approximate Reasoning, 104, 126-143 (2019) · Zbl 1452.68232
[18] Wang, Z.; Shu, L.; Ding, X., Minimal description and MaxD in covering-based rough sets, Fundamenta Informaticae, 128, 503-526 (2013) · Zbl 1285.68187
[19] Xu, W.; Yu, J., A novel approach to information fusion in multi-source datasets: A granular computing viewpoint, Inf. Sci., 378, 410-423 (2017) · Zbl 1429.68301
[20] Xu, W.; Li, W., Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets, IEEE Trans. Cybern., 46, 366-379 (2016)
[21] Yao, Y.; Yao, B., Covering based rough set approximations, Inf. Sci., 200, 91-107 (2012) · Zbl 1248.68496
[22] Yang, B.; Hu, B., A fuzzy covering-based rough set model and its generalization over fuzzy lattice, Inf. Sci., 367-368, 463-486 (2016) · Zbl 1428.03070
[23] Yang, T.; Li, Q., Reduction about approximation spaces of covering generalized rough sets, Int. J. Approximate Reasoning, 51, 335-345 (2010) · Zbl 1205.68433
[24] Yang, L.; Xu, W.; Zhang, X.; Sang, B., Multi-granulation method for information fusion in multi-source decision information system, Int. J. Approximate Reasoning, 122, 47-65 (2020) · Zbl 1445.68224
[25] Yang, B.; Hu, B., Matrix representations and interdependency on L-fuzzy covering-based approximation operators, Int. J. Approximate Reasoning, 96, 57-77 (2018) · Zbl 1446.03098
[26] Yun, Z.; Ge, X.; Bai, X., Axiomatization and conditions for neighborhoods in a covering to form a partition, Inf. Sci., 181, 1735-1740 (2011) · Zbl 1216.68299
[27] Zakowski, W., Approximations in the space (U,\( \operatorname{\Pi} )\), Demonstratio Mathematica, 16, 761-769 (1983) · Zbl 0553.04002
[28] Zhang, Y.; Li, J.; Wu, W., On axiomatic characterizations of three pairs of covering based approximation operators, Inf. Sci., 180, 274-287 (2010) · Zbl 1186.68470
[29] Zhang, X.; Wang, J., Fuzzy \(\beta \)-covering approximation spaces, Int. J. Approximate Reasoning, 126, 27-47 (2020) · Zbl 1490.68238
[30] Zhang, X.; Wang, J.; Zhan, J.; Dai, J., Fuzzy measures and choquet integrals based on fuzzy covering rough sets, IEEE Trans. Fuzzy Syst. (2021)
[31] Zhu, W.; Wang, F., Reduction and axiomatization of covering generalized rough sets, Inf. Sci., 152, 217-230 (2003) · Zbl 1069.68613
[32] Xu, W.; Zhang, W., Measuring roughness of generalized rough sets induced by a covering, Fuzzy Sets Syst., 158, 2443-2455 (2007) · Zbl 1127.68106
[33] Li, W.; Xu, W.; Zhang, X.; Zhang, J., Updating approximations with dynamic objects based on local multigranulation rough sets in ordered information systems, Artificial Intelligence Review (2021)
[34] Xu, W.; Li, Y.; Liao, X., Approaches to attribute reductions based on rough set and matrix computation in inconsistent ordered information systems, Knowl.-Based Syst., 27, 78-91 (2012)
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.