## Generalized rough sets based on relations.(English)Zbl 1129.68088

Summary: Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations. This paper studies arbitrary binary relation based generalized rough sets. In this setting, a binary relation can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a relation under which these properties hold for the relation based lower and upper approximation operations.This paper also explores the relationships between the lower or the upper approximation operation generated by the intersection of two binary relations and those generated by these two binary relations, respectively. Through these relationships, we prove that two different binary relations will certainly generate two different lower approximation operations and two different upper approximation operations.

### MSC:

 68T30 Knowledge representation 68T37 Reasoning under uncertainty in the context of artificial intelligence
Full Text:

### References:

 [1] Angiulli, F.; Pizzuti, C., Outlier mining in large high-dimensional data sets, IEEE Transactions on Knowledge and Data Engineering, 17, 2, 203-215 (2005) [2] Bargiela, A.; Pedrycz, W., Granular Computing: An Introduction (2002), Kluwer Academic Publishers: Kluwer Academic Publishers Boston [3] Bonikowski, Z.; Bryniarski, E.; Wybraniec-Skardowska, U., Extensions and intentions in the rough set theory, Information Sciences, 107, 149-167 (1998) · Zbl 0934.03069 [4] G. Cattaneo, D. Ciucci, Algebraic structures for rough sets, in: LNCS, vol. 3135, 2004, pp. 208-252.; G. Cattaneo, D. Ciucci, Algebraic structures for rough sets, in: LNCS, vol. 3135, 2004, pp. 208-252. · Zbl 1109.68115 [5] J. Dai, Logic for rough sets with rough double stone algebraic semantics, in: RSFDGrC 2005, vol. 3641, LNCS, 2005, pp. 141-147.; J. Dai, Logic for rough sets with rough double stone algebraic semantics, in: RSFDGrC 2005, vol. 3641, LNCS, 2005, pp. 141-147. · Zbl 1134.68501 [6] Dai, J.; Chen, W.; Pan, Y., A minimal axiom group for rough set based on quasi-ordering, Journal of Zhejiang University Science, 5, 7, 810-815 (2004) [7] Dick, S.; Schenker, A.; Pedrycz, W.; Kandel, A., Regranulation: a granular algorithm enabling communication between granular worlds, Information Sciences, 177, 2, 408-435 (2007) · Zbl 1142.68065 [8] Dong, G.; Han, J.; Lam, J.; Pei, J.; Wang, K.; Zou, W., Mining constrained gradients in large databases, IEEE Transactions on Knowledge and Data Engineering, 16, 8, 922-938 (2004) [9] Dubois, D.; Prade, H., Rough fuzzy sets and fuzzy rough sets, International Journal of General Systems, 17, 2-3, 191-209 (1990) · Zbl 0715.04006 [10] Hall, M.; Holmes, G., Benchmarking attribute selection techniques for discrete class data mining, IEEE Transactions on Knowledge and Data Engineering, 15, 6, 1437-1447 (2003) [11] F. Hu, G. Wang, H. Huang, Y. Wu, Incremental attribute reduction based on elementary sets, in: RSFDGrC 2005, vol. 3641, LNCS, 2005, pp. 185-193.; F. Hu, G. Wang, H. Huang, Y. Wu, Incremental attribute reduction based on elementary sets, in: RSFDGrC 2005, vol. 3641, LNCS, 2005, pp. 185-193. · Zbl 1134.68471 [12] Jensen, R.; Shen, Q., Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches, IEEE Transactions on Knowledge and Data Engineering, 16, 12, 1457-1471 (2004) [13] Kondo, M., On the structure of generalized rough sets, Information Sciences, 176, 5, 589-600 (2005) · Zbl 1096.03065 [14] Kryszkiewicz, M., Rough set approach to incomplete information systems, Information Sciences, 112, 39-49 (1998) · Zbl 0951.68548 [15] Kryszkiewicz, M., Rule in incomplete information systems, Information Sciences, 113, 271-292 (1998) · Zbl 0948.68214 [16] Leung, Y.; Wu, W.-Z.; Zhang, W.-X., Knowledge acquisition in incomplete information systems: a rough set approach, European Journal of Operational Research, 168, 164-180 (2006) · Zbl 1136.68528 [17] D.-G. Li, D.-Q. Miao, Y.-Q. Yin, Relation of relative reduct based on nested decision granularity, in: IEEE GrC 2006, 2006, pp. 397-400.; D.-G. Li, D.-Q. Miao, Y.-Q. Yin, Relation of relative reduct based on nested decision granularity, in: IEEE GrC 2006, 2006, pp. 397-400. [18] T.Y. Lin, Granular computing on binary relations-analysis of conflict and chinese wall security policy, in: Rough Sets and Current Trends in Computing, LNAI, vol. 2475, 2002, pp. 296-299.; T.Y. Lin, Granular computing on binary relations-analysis of conflict and chinese wall security policy, in: Rough Sets and Current Trends in Computing, LNAI, vol. 2475, 2002, pp. 296-299. · Zbl 1013.68582 [19] T.Y. Lin, Granular computing – structures, representations, and applications, in: LNAI, vol. 2639, 2003, pp. 16-24.; T.Y. Lin, Granular computing – structures, representations, and applications, in: LNAI, vol. 2639, 2003, pp. 16-24. · Zbl 1026.68636 [20] Lin, T. Y.; Liu, Q., Rough approximate operators: axiomatic rough set theory, (Ziarko, W., Rough Sets, Fuzzy Sets and Knowledge Discovery (1994), Springer), 256-260 · Zbl 0818.03028 [21] Q. Liu, Semantic analysis of rough logical formulas based on granular computing, in: IEEE GrC 2006, 2006, pp. 393-396.; Q. Liu, Semantic analysis of rough logical formulas based on granular computing, in: IEEE GrC 2006, 2006, pp. 393-396. [22] G. Liu, The transitive closures of matrices over distributive lattices, in: IEEE GrC 2006, 2006, pp. 63-66.; G. Liu, The transitive closures of matrices over distributive lattices, in: IEEE GrC 2006, 2006, pp. 63-66. [23] Pal, S.; Mitra, P., Case generation using rough sets with fuzzy representation, IEEE Transactions on Knowledge and Data Engineering, 16, 3, 292-300 (2004) [24] Pawlak, Z., Rough Sets: Theoretical Aspects of Reasoning about Data (1991), Kluwer Academic Publishers: Kluwer Academic Publishers Boston · Zbl 0758.68054 [25] Pawlak, Z.; Skowron, A., Rudiments of rough sets, Information Sciences, 177, 1, 3-27 (2007) · Zbl 1142.68549 [26] Pawlak, Z.; Skowron, A., Rough sets: some extensions, Information Sciences, 177, 1, 28-40 (2007) · Zbl 1142.68550 [27] Pawlak, Z.; Skowron, A., Rough sets and boolean reasoning, Information Sciences, 177, 1, 41-73 (2007) · Zbl 1142.68551 [28] Pedrycz, W.; Bargiela, A., Fuzzy fractal dimensions and fuzzy modeling, Information Sciences, 153, 199-216 (2003) · Zbl 1046.93501 [29] (Polkowski, L.; Skowron, A., Rough Sets and Current Trends in Computing, vol. 1424 (1998), Springer: Springer Berlin) · Zbl 0891.00026 [30] (Polkowski, L.; Skowron, A., Rough Sets in Knowledge Discovery, vol. 1 (1998), Physica-Verlag: Physica-Verlag Heidelberg, Berlin) · Zbl 0910.00028 [31] (Polkowski, L.; Skowron, A., Rough Sets in Knowledge Discovery, vol. 2 (1998), Physica-Verlag: Physica-Verlag Heidelberg, Berlin) · Zbl 0910.00028 [32] Qin, K.; Pei, Z., On the topological properties of fuzzy rough sets, Fuzzy Sets and Systems, 151, 3, 601-613 (2005) · Zbl 1070.54006 [33] K. Qin, Z. Pei, W. Du, The relationship among several knowledge reduction approaches, in: FSKD 2005, LNCS, vol. 3613, 2005, pp. 1232-1241.; K. Qin, Z. Pei, W. Du, The relationship among several knowledge reduction approaches, in: FSKD 2005, LNCS, vol. 3613, 2005, pp. 1232-1241. [34] Slowinski, R.; Vanderpooten, D., A generalized definition of rough approximations based on similarity, IEEE Transactions on Knowledge and Data Engineering, 12, 2, 331-336 (2000) [35] Su, C.; Hsu, J., An extended chi2 algorithm for discretization of real value attributes, IEEE Transactions on Knowledge and Data Engineering, 17, 3, 437-441 (2005) [36] Wang, F.-Y., Outline of a computational theory for linguistic dynamic systems: toward computing with words, International Journal of Intelligent Control and Systems, 2, 2, 211-224 (1998) [37] Wang, F.-Y., On the abstraction of conventional dynamic systems: from numerical analysis to linguistic analysis, Information Sciences, 171, 1-3, 233-259 (2005) · Zbl 1068.93010 [38] G. Wang, F. Liu, The inconsistency in rough set based rule generation., in: Rough Sets and Current Trends in Computing, LNCS, vol. 2005, 2000, pp. 370-377.; G. Wang, F. Liu, The inconsistency in rough set based rule generation., in: Rough Sets and Current Trends in Computing, LNCS, vol. 2005, 2000, pp. 370-377. · Zbl 1014.68874 [39] Wu, W.-Z.; Leung, Y.; Mi, J.-S., On characterizations of $$(I,T)$$-fuzzy rough approximation operators, Fuzzy Sets and Systems, 154, 1, 76-102 (2005) · Zbl 1074.03027 [40] Wu, W.-Z.; Mi, J.-S.; Zhang, W.-X., Generalized fuzzy rough sets, Information Sciences, 151, 263-282 (2003) · Zbl 1019.03037 [41] Wu, W.-Z.; Zhang, W.-X., Constructive and axiomatic approaches of fuzzy approximation operators, Information Sciences, 159, 3-4, 233-254 (2004) · Zbl 1071.68095 [42] W.-Z. Wu, W.-X. Zhang, Rough set approximations vs. measurable spaces, in: IEEE GrC 2006, 2006, pp. 329-332.; W.-Z. Wu, W.-X. Zhang, Rough set approximations vs. measurable spaces, in: IEEE GrC 2006, 2006, pp. 329-332. [43] Yang, X.-P.; Li, T.-J., The minimization of axiom sets characterizing generalized approximation operators, Information Sciences, 176, 887-899 (2006) · Zbl 1094.03042 [44] Yao, Y., A comparative study of fuzzy sets and rough sets, Information Sciences, 109, 227-242 (1998) · Zbl 0932.03064 [45] Y. Yao, On generalizing Pawlak approximation operators, in: LNAI, vol. 1424, 1998, pp. 298-307.; Y. Yao, On generalizing Pawlak approximation operators, in: LNAI, vol. 1424, 1998, pp. 298-307. · Zbl 0955.68505 [46] Yao, Y., Relational interpretations of neighborhood operators and rough set approximation operators, Information Sciences, 101, 239-259 (1998) · Zbl 0949.68144 [47] Yao, Y., Constructive and algebraic methods of theory of rough sets, Information Sciences, 109, 21-47 (1998) · Zbl 0934.03071 [48] Y. Yao, Granular computing: basic issues and possible solutions, in: Proceedings of the 5th Joint Conference on Information Sciences, vol. 1, 2000, pp. 186-189.; Y. Yao, Granular computing: basic issues and possible solutions, in: Proceedings of the 5th Joint Conference on Information Sciences, vol. 1, 2000, pp. 186-189. [49] Y. Yao, Y. Chen, Subsystem based generalizations of rough set approximations, in: LNCS, vol. 3488, 2005, pp. 210-218.; Y. Yao, Y. Chen, Subsystem based generalizations of rough set approximations, in: LNCS, vol. 3488, 2005, pp. 210-218. · Zbl 1132.68760 [50] J. Yao, W.-N. Liu, The STP model for solving imprecise problems, in: IEEE GrC 2006, 2006, pp. 683-687.; J. Yao, W.-N. Liu, The STP model for solving imprecise problems, in: IEEE GrC 2006, 2006, pp. 683-687. [51] Zadeh, L. A., Fuzzy sets, Information and Control, 8, 338-353 (1965) · Zbl 0139.24606 [52] Zadeh, L. A., The concept of a linguistic variable and its application to approximate reasoning - I, Information Sciences, 8, 199-249 (1975) · Zbl 0397.68071 [53] Zadeh, L. A., The concept of a linguistic variable and its application to approximate reasoning - II, Information Sciences, 8, 301-357 (1975) · Zbl 0404.68074 [54] Zadeh, L. A., The concept of a linguistic variable and its application to approximate reasoning - III, Information Sciences, 9, 43-80 (1975) · Zbl 0404.68075 [55] Zadeh, L. A., Fuzzy logic=computing with words, IEEE Transactions on Fuzzy Systems, 4, 103-111 (1996) [56] Zadeh, L. A., Toward a generalized theory of uncertainty (gtu)—an outline, Information Sciences, 172, 1-2, 1-40 (2005) · Zbl 1074.94021 [57] Zhong, N.; Yao, Y.; Ohshima, M., Peculiarity oriented multidatabase mining, IEEE Transactions on Knowledge and Data Engineering, 15, 4, 952-960 (2003) [58] Zhu, F.; He, H.-C., The axiomization of the rough set, Chinese Journal of Computers, 23, 3, 330-333 (2000) [59] Zhu, F.; He, H.-C., Logical properties of rough sets, (Proceedings of The Fourth International Conference on High Performance Computing in the Asia-Pacific Region, vol. 2 (2000), IEEE Press), 670-671 [60] Zhu, W.; Wang, F.-Y., Reduction and axiomization of covering generalized rough sets, Information Sciences, 152, 217-230 (2003) · Zbl 1069.68613 [61] W. Zhu, F.-Y. Wang, Relationships among three types of covering rough sets, in: IEEE GrC 2006, 2006, pp. 43-48.; W. Zhu, F.-Y. Wang, Relationships among three types of covering rough sets, in: IEEE GrC 2006, 2006, pp. 43-48. [62] W. Zhu, F.-Y. Wang, Covering based granular computing for conflict analysis, in: IEEE ISI 2006, LNCS, vol. 3975, 2006, pp. 566-571.; W. Zhu, F.-Y. Wang, Covering based granular computing for conflict analysis, in: IEEE ISI 2006, LNCS, vol. 3975, 2006, pp. 566-571. [63] W. Zhu, F.-Y. Wang, Axiomatic systems of generalized rough sets, in: RSKT 2006, LNAI, vol. 4062, 2006, pp. 216-221.; W. Zhu, F.-Y. Wang, Axiomatic systems of generalized rough sets, in: RSKT 2006, LNAI, vol. 4062, 2006, pp. 216-221. · Zbl 1196.03078 [64] W. Zhu, F.-Y. Wang, A new type of covering rough sets, in: IEEE IS 2006, 4-6 September 2006, 2006, pp. 444-449.; W. Zhu, F.-Y. Wang, A new type of covering rough sets, in: IEEE IS 2006, 4-6 September 2006, 2006, pp. 444-449. [65] W. Zhu, F.-Y. Wang, Binary relation based rough sets, in: IEEE FSKD 2006, LNAI, vol. 4223, 2006, pp. 276-285.; W. Zhu, F.-Y. Wang, Binary relation based rough sets, in: IEEE FSKD 2006, LNAI, vol. 4223, 2006, pp. 276-285. [66] W. Zhu, F.-Y. Wang, Properties of the first type of covering-based rough sets, in: Proceedings of DM Workshop 06, ICDM 06, Hong Kong, China, December 18, 2006, 2006, pp. 407-411.; W. Zhu, F.-Y. Wang, Properties of the first type of covering-based rough sets, in: Proceedings of DM Workshop 06, ICDM 06, Hong Kong, China, December 18, 2006, 2006, pp. 407-411. [67] Zhu, W., Topological approaches to covering rough sets, Information Sciences, 177, 6, 1499-1508 (2007) · Zbl 1109.68121 [68] Zhu, W.; Wang, F.-Y., On three types of covering rough sets, IEEE Transactions on Knowledge and Data Engineering, 19, 8 (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.