Operation Properties and Algebraic Application of Covering Rough Sets

• Autorzy: Kong Q. , Xu W.

Identyfikatory

DOI

10.3233/FI-2018-1688

• Języki publikacji: EN

Abstrakty

EN

Rough set theory is one of the most important tools for data mining. The covering rough set (CRS) model is an excellent generalization of Pawlak rough sets. In this paper, we first investigate a number of basic properties of two types of CRS models. Especially, we study the operation properties of the two types of CRS models with respect to the unary covering. Meanwhile, several corresponding algorithms are constructed for computing the intersection and union of rough sets and some examples are employed to illustrate the effectiveness of these algorithms.Finally, as an application of the operation properties of CRS, some basic algebraic properties of CRS are explored. It is evident that these results will enrich the theory of covering rough sets.

Słowa kluczowe

EN

rough sets; unary; covering; operation properties; algebraic properties

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2018
• Tom: Vol. 160, nr 4
• Strony: 385--408
• Opis fizyczny: Bibliogr. 78 poz., tab.

Twórcy

autor

Kong Q.

• School of Science, Jimei University, Xiamen, 361021, China

autor

Xu W.

• School of Science, Chongqing University of Technology, Chongqing, 400054, China

Bibliografia

• [1] Apolloni B, Brega A, Malchiodi D, Palmas G et al. Learning rule representations from data, IEEE Transactions on Systems, Man and Cybernetics, Part A, 2006;36(5):1010-1028. doi:10.1109/TSMCA.2006.878987.
• [2] Bonikowski Z, Bryniorski E, Wybraniec-Skardowska U. Extensions and intentions in the rough set theory, Inrormation Sciences, 1998;107(1-4):149-167. URL https://doi.org/10.1016/S0020-0255(97)10046-9.
• [3] Bargiela A and Pedrycz W. Granular mapping, IEEE Transactions on Systems, Man and Cybernetics, Part A, 2005;35(2):292-297. doi:10.1109/TSMCA.2005.843381.
• [4] Biswas R and Nanda S. Rough groups and rough subgroups. Bulletin of the Polish Academy of Sciences Mathematics, 1994;42(3):251-254.
• [5] Chen DG, Wang CZ, Hu QH. A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets, Information Sciences, 2007;177(17):3500-3518. URL https://doi.org/10.1016/j.ins.2007.02.041.
• [6] Chen JK and Li JJ. An application of rough sets to graph theory, Information Sciences, 2012;201(15):114-127. URL https://doi.org/10.1016/j.ins.2012.03.009.
• [7] Chen HM, Li TR, Qiao SJ, Ruan D. A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values, International Journal of Intelligent Systems, 2010;25:1005-1026. URL https://doi.org/10.1002/int.20436.
• [8] Chen HM, Li TR, Ruan D, Lin JH, Hu CX. A rough-set based incremental approach for updating approximations under dynamic maintenance environments, IEEE Transactions on Knowledge and Data Engineering, 2011;25(2):274-284. doi:10.1109/TKDE.2011.220.
• [9] Comer S. An algebraic approach to the approximation of information. Fundamenta Informaticae, 1991;14:492-502.
• [10] Dai JH. Rough 3-valued algebras, Information Sciences, 2008;178(8):1986-1996. URL https://doi.org/10.1016/j.ins.2007.11.011.
• [11] Duntsch I and Dediga G. Uncertainty measures of rough set prediction, Artificial Intelligence, 1998;106(1):109-137. URL https://doi.org/10.1016/S0004-3702(98)00091-5.
• [12] Fan SD and Zhi TY. The algebraic property of rough sets, Journal of Shanxi University, 2001;24:116-119. (in China).
• [13] Ge X and Li Z. Definable subsets in covering approximation spaces, International Journal Computing Mathmatical Sciences, 2011;5(1):31-34.
• [14] Hu QH, Yu DR, Liu JF, Wu CX. Neighborhood rough set based heterogeneous feature selection, Information Sciences, 2008;178(18):3577-3594. URL https://doi.org/10.1016/j.ins.2008.05.024.
• [15] Hu QH, Pedrgcz W, Yu DR, Lang J. Selecting discrete and continuous feasures based on neighborhood decision error minimization, IEEE Transactions on Systems, Man and Cybernetics Part B: Cybernetics, 2010;40(1):137-150. doi:10.1109/TSMCB.2009.2024166.
• [16] Iwiński TB. Algebraic approach to rough sets. Bulletion of the Polish Academy of Sciences(Math), 1987;35(9-10):673-683.
• [17] Kong QZ and Wei ZX. Covering-based fuzzy rough sets, Journal of Intelligent and Fuzzy Systems, 2015;29(6):2405-2411. doi:10.3233/IFS-151940.
• [18] Kong QZ and Wei ZX. Further study of multi-granulation fuzzy rough sets, Journal of Intelligent and Fuzzy Systems, 2017;32(3):2413-2424. doi:10.3233/JIFS-16373.
• [19] Kuroki N and Wang PP. The lower and upper approximations in a fuzzy group. Information Sciences, 1996;90(1-4):203-220. URL https://doi.org/10.1016/0020-0255(95)00282-0.
• [20] Kuroki N. Rough ideals in semigroups. Information Sciences, 1997;100(1-4):139-163. URL https://doi.org/10.1016/S0020-0255(96)00274-5.
• [21] Li DY. Algebraic aspects and knowledge reduction in rough set theory. Xi’an Jiaotong University Doctor Paper, 2002.
• [22] Li JH, Mei CL, Lv YJ. Incomplete decision contexts: Approximate concept construction, rule acquisition and knowledge reduction, International Journal of Approximate Reasoning, 2013;54(1):149-165. URL https://doi.org/10.1016/j.ijar.2012.07.005.
• [23] Li JH, Mei CL, Lv YJ. Knowledge reduction in real decision formal contexts, Information Sciences, 2012;189:191-207. doi:10.1016/j.ins.2011.11.041.
• [24] Li D, Zhang B, Leung Y, On knowledge reduction in inconsistent decision information systems, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2004;12(5):651-672. URL https://doi.org/10.1142/S0218488504003132.
• [25] Li TR, Ruan D, Greet W, Song J, Xu Y. A rough sets based characteristic relation approach for dynamic attribute generalization in data mining, Knowledge-Based Systems, 2007;20(5):485-494. doi:10.1016/j.knosys.2007.01.002.
• [26] Liang JY, Wang F, Dang CY, Qian YH. An efficient rough feature selection algorithm with a multigranulation view, International Journal of Approximate Reasoning, 2012;53(7):1080-1093. URL https://doi.org/10.1016/j.ijar.2012.02.004.
• [27] Liang JY and Qian YH. Axiomatic approach of knowledge granulation in information systems, Lecture Notes in Computer Science, vol 4304. Springer, 2006 pp. 1074-1078.
• [28] Liang JY and Xu ZB. The algorithm on knowledge reduction in incomplete information systems, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2002;24(1):95-103. URL https://doi.org/10.1142/S021848850200134X.
• [29] Liang JY, Zhao XW, Li DY, Cao FY, Dang CY. Determining the number of clusters using information entropy for mixed data, Pattern Recognition, 2012;45(6):2251-2265. URL https://doi.org/10.1016/j.patcog.2011.12.017.
• [30] GP Lin, Liang JY, Qian YH. Information Sciences, 2013;241:101-118. URL https://doi.org/10.1016/j.ins.2013.03.046.
• [31] Lin TY. From rough sets and neighborhood systems to information granulation computing in words, Proceeding Europe Congress Intelligent Techniques and Soft Computing, 1997, pp. 1602-1606.
• [32] Liu GL and Zhu W. The algebraic structures of generalized rough set theory, Information Sciences, 2008;178(21):4105-4113. URL https://doi.org/10.1016/j.ins.2008.06.021.
• [33] Liu GL and Sai Y. A comparison of two types of rough sets induced by coverings, International Journal of Approximate Reasoning, 2009;50(3):521-528. URL https://doi.org/10.1016/j.ijar.2008.11.001.
• [34] Liu CH and Miao DQ. Covering rough set model based on multi-granulations, in: Proceedings of the Thirteenth International Conference on Rough Sets, Fuzzy Set, Data Mining and Granular Computing, in: Lecture Notes in Computer Science, vol. 6743. Springer, 2011 pp. 87-90. doi:10.1007/978-3-642-21881-1_15.
• [35] Liu CH, Miao DQ, Qian J. On multi-granulation covering rough sets, International Journal of Approximate Reasoning, 2014;55(6):1404-1418. URL https://doi.org/10.1016/j.ijar.2014.01.002.
• [36] Mordeson JN. Rough set theory applied to (fuzzy) ideal theory, Fuzzy Sets and Systems, 2001;121(2):315-324. URL https://doi.org/10.1016/S0165-0114(00)00023-3.
• [37] Pawlak Z. Rough sets, International Journal of Computer and Information Sciences, 1982;11(5):341-356.doi:10.1007/BF01001956.
• [38] Pawlak Z. Rough Set: Theoretical Aspects of Reasoning about Data, Dordrecht: Kluwer Academic Publishers, 1991. ISBN- 978-0-7923-1472-1, 978-94-010-5564-2.
• [39] Pagliani P. Gough sets and Nelson algebras. Fundamenta Informaticae, 1996;27:205-219.
• [40] Pagliani P. Rough set theory and logic-algebraic structures, in Studies in Fuzziness and Soft Computing vol. 13 (Ewa Orlowska eds.), Physica-verlag, New York, 1998, pp. 109-190. doi:10.1007/978-3-7908-1888-8_6.
• [41] Pedrycz W and Bargiela A. Granular clustering: a granular signature of data, IEEE Transactions on Systems, Man and Cybernetics, Part A, 2002;32(2):212-224. doi:10.1109/3477.990878.
• [42] Pedrycz W. Relational and directional aspects in the construction of information granulars, IEEE Transactions on Systems, Man and Cybernetics, Part A, 2002;32(5):605-614. doi:10.1109/TSMCA.2002.804790.
• [43] Polkowski L and Skowron A. Rough mereology: A new paradigm for approximate reasoning, International Journal of Approximate Reasoning, 1996;15(4):333-365. URL https://doi.org/10.1016/S0888-613X(96)00072-2.
• [44] Pomkala JA. On definability in the nondeterministic information system, Bulletin of the Polish Academy of Science, Mathematics, 1988;36:193-210.
• [45] Pomkala JA. Approximation operations in approximation space, Bulletin of the Polish Academy of Sciences, 1987;9-10:653-662.
• [46] Qian YH, Liang JY, Pedrycz W, Dang CY. Positive approximation: An accelerator for attribute reduction in rough set theory, Artificial Intelligence, 2010;174(9-10):597-618. URL https://doi.org/10.1016/j.artint.2010.04.018.
• [47] Qin K, Gao Y, Pei Z. On covering rough sets, J. T. Yao et al.(Eds.): RSKT 2007, Lecture Notes in Computer Science, vol. 4481. Springer, 2007 pp. 34-41. doi:10.1007/978-3-540-72458-2_4.
• [48] She YH and He XL. On the structure of the multi-granulation rough set model, Knowledge-Based Systems, 2012;36:81-92. URL https://doi.org/10.1016/j.knosys.2012.05.019.
• [49] Shi ZH and Gong ZT. The futher investigation of covering-based rough sets: Uncertainty characterization, similarity measure and generalized models, Information Sciences, 2010;180(19):3745-3763. doi:10.1016/j.ins.2010.06.020.
• [50] Skowron A and Stepaniuk J. Tolerance approximation spaces, Fundamenta Informaticae, 1996;27:245-253.
• [51] Slowinski R and Vanderpooten D. A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, 2000;12(2):331-336. doi:10.1109/69.842271.
• [52] Swiniarski RW and Skowron A. Rough set method in feature selection and recognition, Pattern Recognition letter, 2003;24(6):833-849. doi:10.1016/S0167-8655(02)00196-4.
• [53] Tsumoto S. Automated extraction of hierarchical decision rules from clinical databases using rough set model, Expert Systems with Applications, 2003;24(2):189-197. doi:10.1016/S0957-4174(02)00142-2.
• [54] Tang YQ, Min F, Li JH. An information fusion technology for triadic decision contexts. International Journal of Machine Learning and Cybernetics, 2016;7(1):13-24. doi:10.1007/s13042-015-0411-0.
• [55] Wang CZ, Qi YL, Shao MW, Hu QH, Chen DG, Qian YH, Lin YJ. A fitting model for feature selection with fuzzy rough sets. IEEE Transaction on Fuzzy Systems, 2017;25(4):741-753. doi:10.1109/TFUZZ.2016.2574918.
• [56] Wang CZ, Shao MW, He Q, Qian YH, Qi YL. Feature subset selection based on fuzzy neighborhood rough sets. Knowledge-Based Systems, 2016;111(1):173-179. URL https://doi.org/10.1016/j.knosys.2016.08.009.
• [57] Xu WH, Wang QR, Zhang XT. Multi-granulation rough sets based on tolerance relations, Soft Computing, 2013;17(7):1241-1252. doi:10.1007/s00500-012-0979-1.
• [58] Xu WH and Li WT. Granular computing approach to two-way learning based on formal concept analysis in fuzzy datasets, IEEE Transactions on Cybernetics, 2016;46(2):366-379. doi:10.1109/TCYB.2014.2361772.
• [59] Xu WH and Yu JH. A novel approach to information fusion in multi-sourse datasets: A granular computing viewpoint, Information Sciences, 2016 doi:10.1016/j.ins.2016.04.009.
• [60] Xu WH and Guo YT. Generalized multi-granulation double-quantitative decision-theoretic rough set, Knowledge-Based Systems, 2016;105(1):190-205. URL https://doi.org/10.1016/j.knosys.2016.05.021.
• [61] Yao H and Zhu W. Applications of repeat degree to coverings of neighborhoods. International Journal of Machine Learning and Cybernetics, 2016;7(6):931-941.
• [62] Yao YY. Information granulation and rough set approximation, International Journal of Intelligent Systems, 2001;16(1):87-104. URL https://doi.org/10.1002/1098-111X(200101)16:1<87:AID-INT7>3.0.CO;2-S.
• [63] Yao YY and Yao BX. Covering based rough set approximations, Information Sciences, 2012;200(1):91-107. doi:10.1016/j.ins.2012.02.065.
• [64] Yao YY. Relational interpretations of neighborhood operators and rough set approximation operators, Information Sciences, 1998;101(1-4):239-259. URL https://doi.org/10.1016/S0020-0255(98)10006-3.
• [65] Yao YY. On generalizing rough set theory, in: Proceeding of the Ninth International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, in: Lecture Notes in Computer Science, vol.2639, Springer 2003 pp. 44-51. ISBN:3-540-14040-9.
• [66] Yao YY. Constructive and algebraic methods of the theory of rough sets, Information Sciences, 1998;109(1-4):21-47. URL https://doi.org/10.1016/S0020-0255(98)00012-7.
• [67] Yao YY. Two views of the theory of rough sets in finite universes. International Journal of Approximate Reasoning, 1996;15(4):291-317. URL https://doi.org/10.1016/S0888-613X(96)00071-0.
• [68] Yu JH and Xu WH. Incremental knowledge discovering in interval-valued decision information system with the dynamic data. International Journal of Machine Learning and Cybernetics, 2017;8(3):159-170. doi:10.1007/s13042-015-0473-z.
• [69] Zakowski W. Approximations in the space (u;π), Demonstration Mathematica, 1983;16:761-769.
• [70] Zhao YX, Li JH, Liu WQ, Xu WH. Cognitive concept learning from incomplete information. International Journal of Machine Learning and Cybernetics, 2017;8(1):849-864. doi:10.1007/s13042-016-0553-8.
• [71] Zhang WX, Wu WZ, Liang JY, Li DY. Rough sets theory and approach. Science Press, Beijing, 2001.(in China).
• [72] Zhang XW and Kong QZ. On four types of multi-covering rough sets, Fundamenta Informaticae, 2016;147(4):457-476. doi:10.3233/FI-2016-1417.
• [73] Zhang XY, Wei L, Xu WH. Attributes reduction ang rules acquisition in an lattice-valued information system with fuzzy decision. International Journal of Machine Learning and Cybernetics, 2017;8(1):135-148. doi:10.1007/s13042-015-0492-9.
• [74] Zhu W and Wang FY. On three types of covering rough sets, IEEE Transactions on Knowledge Data Engineering, 2007;19(8):1131-1144. doi:10.1109/TKDE.2007.1044.
• [75] Zhu W. Topological approaches to covering rough sets, Information Sciences, 2007;177(6):1499-1508. URL https://doi.org/10.1016/j.ins.2006.06.009.
• [76] Zhu W. Relationship between generalized rough sets based on binary relation and covering, Information Sciences, 2009;179(3):210-225. URL https://doi.org/10.1016/j.ins.2008.09.015.
• [77] Zhu W. Relationship among basic concepts in covering based rough sets, Information Sciences, 2009;179(14):2478-2486. URL https://doi.org/10.1016/j.ins.2009.02.013.
• [78] Zhu W. Generalized rough sets based on relations, Information Sciences, 2007;177(22):4997-5001. URL https://doi.org/10.1016/j.ins.2007.05.037.

Uwagi

Opracowanie rekordu w ramach umowy 509/P-DUN/2018 ze środków MNiSW przeznaczonych na działalność upowszechniającą naukę (2018).