×

Axiomatization and conditions for neighborhoods in a covering to form a partition. (English) Zbl 1216.68299

Summary: We study the axiomatic issue of a type of covering upper approximation operations. This issue was proposed as an open problem. We also further some known results by using only a single covering approximation operator to characterize the conditions for the neighborhood \(\{N(x): x \in U\}\) to form a partition of universe \(U\).

MSC:

68T37 Reasoning under uncertainty in the context of artificial intelligence
03E70 Nonclassical and second-order set theories
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Balogh, Z.; Gruenhage, G., When the collection of &z.epsiv;-balls is locally finite, Topology and its Applications, 124, 445-450 (2002) · Zbl 1015.54011
[2] Birkhoff, G., Rings of sets, Duke Mathematical Journal, 3, 443-454 (1937) · JFM 63.0832.02
[3] Bonikowski, Z.; Bryniarski, E.; Wybraniec, U., Extensions and intensions in the rough set theory, Information Sciences, 107, 149-167 (1998) · Zbl 0934.03069
[4] Cattaneo, G., Abstract approximation spaces for rough theories, (Polkowski, L.; Skowron, A., Rough Sets in Knowledge Discovery, Methodology and Applications, Vol. 1 (1998), Physica-Verlag: Physica-Verlag Heidelberg), 59C 98
[5] Kondo, M., On the structure of generalized rough sets, Information Sciences, 176, 586-600 (2006) · Zbl 1096.03065
[6] Lashin, E.; Kozae, A.; Khadra, A.; Medhat, T., Rough set theory for topological spaces, International Journal of Approximate Reasoning, 40, 35-43 (2005) · Zbl 1099.68113
[7] Lin, T.; Liu, Q., Rough approximate operators: axiomatic rough set theory, (Ziarko, W. P., Proceedings Int’l Workshop Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery (1994), Springer-Verlag: Springer-Verlag London), 256-260 · Zbl 0818.03028
[8] Liu, W., Topological space properties of rough sets, (Proceedings of 2004 International Conference on Machine Learning and Cybernetics (2004), IEEE Computer Society: IEEE Computer Society Washington), 2353-2355
[9] Nagata, J., Some questions concerning symmetric neighborhood assignments, Q and A in General Topology, 22, 5-8 (2004) · Zbl 1053.54537
[10] Pawlak, Z., Rough sets, International journal of computer and information science, 11, 341-356 (1982) · Zbl 0501.68053
[11] Pawlak, Z., Rough sets: Theoretical aspects of reasoning about data (1991), Kluwer Academic Publishers.: Kluwer Academic Publishers. Boston · Zbl 0758.68054
[12] Pawlak, Z.; Skowron, A., Rudiments of rough sets, Information Sciences, 177, 3-27 (2007) · Zbl 1142.68549
[13] Pawlak, Z.; Skowron, A., Rough sets: Some extensions, Information Sciences, 177, 28-40 (2007) · Zbl 1142.68550
[14] Pawlak, Z.; Skowron, A., Rough sets and Boolean reasoning, Information Sciences, 177, 41-73 (2007) · Zbl 1142.68551
[15] Pomykala, J., Approximation operations in approximation space, Bulletin Polish Academy of Sciences-Mathematics, 35, 653-662 (1987) · Zbl 0642.54002
[16] Pomykala, J., The Stone algebra of rough sets, Bulletin Polish Academy of Sciences-Mathematics, 36, 495-508 (1988) · Zbl 0786.04008
[17] Qin, K.; Gao, Y.; Pei, Z., On covering rough sets, Lecture Notes in Computer Science, 4481, 34-41 (2007)
[18] Qin, K.; Yang, J.; Pei, Z., Generalized rough sets based on reflexive and transitive relations, Information Sciences, 178, 4138-4141 (2008) · Zbl 1153.03316
[19] P. Samanta and M. Chakraborty, Covering based approaches to rough sets and implication lattices, in: Proceedings LNAI 5908, 2009, pp. 127-134.; P. Samanta and M. Chakraborty, Covering based approaches to rough sets and implication lattices, in: Proceedings LNAI 5908, 2009, pp. 127-134.
[20] Skowron, A., Tolerance approximation spaces, Fundamenta Informaticae, 27, 245-253 (1996) · Zbl 0868.68103
[21] Slowinski, R.; Vanderpooten, D., A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, 12, 331-336 (2000)
[22] Tsang, E.; Cheng, D.; Lee, J.; Yeung, D., On the upper approximations of covering generalized rough sets, (Proceedings of 2004 International Conference on Machine Learning and Cybernetics (2006), IEEE Computer Society: IEEE Computer Society Washington), 4200-4203
[23] Yao, Y., Constructive and algebraic methods of the theory of rough sets, Information Sciences, 109, 21-47 (1998) · Zbl 0934.03071
[24] Zakowski, W., Approximations in the Space \((u\),Π), Demonstratio Mathematica, 16, 761-769 (1983) · Zbl 0553.04002
[25] Zhang, H.; Yang, Y.; Wang, Z., Note on “Generalized rough sets based on reflexive and transitive relations”, Information Sciences, 179, 471-473 (2009) · Zbl 1159.03328
[26] Zhang, Y.; Li, J.; Wu, W., On axiomatic characterizations of three pairs of covering based approximation operators, Information Sciences, 180, 274-287 (2010) · Zbl 1186.68470
[27] Zhu, W., Properties of the fourth type of covering based rough sets, (Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006), IEEE Computer Society: IEEE Computer Society Washington), 43
[28] Zhu, W., Topological approaches to covering rough sets, Information Sciences, 177, 1499-1508 (2007) · Zbl 1109.68121
[29] Zhu, W., Relationship between generalized rough sets based on binary relation and covering, Information Sciences, 179, 210-225 (2009) · Zbl 1163.68339
[30] Zhu, W.; Wang, F., Reduction and axiomatization of covering generalized rough sets, Information Sciences, 152, 217-230 (2003) · Zbl 1069.68613
[31] Zhu, W.; Wang, F., Binary relation based rough set, Lecture Notes in Computer Science, 4223, 276-285 (2006)
[32] Zhu, W.; Wang, F., On three types of covering-based rough sets, IEEE Transactions on Knowledge and Data Engineering, 19, 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.