A semantically sound approach to Pawlak rough sets and covering-based rough sets

International Journal of Approximate Reasoning

Volumn 78, Issue , 2016, Pages 62-72

  D'eer, Lynn ^a   Cornelis, Chris ^a,b   Yao, Yiyu ^c  

^a GHENT UNIVERSITY   (Belgium)

^b UNIVERSITY OF GRANADA   (Spain)

^c UNIVERSITY OF REGINA   (Canada)

Author keywords

Concepts; Covering; Pawlak; Rough sets; Semantics

Indexed keywords

ALGEBRA; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; COMPUTATIONAL LINGUISTICS; DATA MINING; LEARNING SYSTEMS; SEMANTICS;

APPROXIMATION OPERATORS; CONCEPTS; CONCEPTUAL APPROACHES; COVERING; LOWER APPROXIMATION; PAWLAK; PAWLAK ROUGH SET; PAWLAK'S ROUGH SET MODEL;

ROUGH SET THEORY;

EID: 84978154114     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2016.06.013     Document Type: Article

References (41)

1. [1] Bonikowski, Z., Bryniarski, E., Wybraniec-Skardowska, U., Extensions and intentions in the rough set theory. Inf. Sci. 107:1 (1998), 149–167.
2. [2] Couso, I., Dubois, D., Rough sets, coverings and incomplete information. Fundam. Inform. 108 (2011), 223–247.
3. [3] D'eer, L., Restrepo, M., Cornelis, C., Gómez, J., Neighborhood operators for covering based rough sets. Inf. Sci. 336 (2016), 21–44.
4. [4] Greco, S., Matarazzo, B., Słowiński, R., Rough sets theory for multi-criteria decision analysis. Eur. J. Oper. Res. 129:1 (2001), 1–47.
5. [5] Greco, S., Matarazzo, B., Słowiński, R., Multicriteria classification by dominance-based rough set approach. Kloesgen, W., Zytkow, J., (eds.) Handbook of Data Mining and Knowledge Discovery, 2002, Oxford University Press, New York.
6. [6] Grzymala-Busse, J.W., Zou, X., Classification strategies using certain and possible rules. Plokowski, L., Skowron, A., (eds.) Proceedings of the First International Conference on Rough Sets and Current Trends in Computing, RSCTC '98, Polkowski, 1998, Springer-Verlag, London, 37–44.
7. [7] Grzymala-Busse, J.W., Three approaches to missing attribute values: a rough set perspective. Data Mining: Foundations and Practice, 2008, Springer, Berlin, Heidelberg, 139–152.
8. [8] Grzymala-Busse, J.W., Rule induction from rough approximations. Springer Handbook of Computational Intelligence, 2015, Springer, Berlin, Heidelberg, 371–385.
9. [9] Järvinen, J., Approximations and rough sets based on tolerances. Rough Sets and Current Trends in Computing Lect. Notes Comput. Sci., 2005, 182–189.
10. [10] Kryszkiewicz, M., Rules in incomplete information systems. Inf. Sci. 113:3 (1999), 271–292.
11. [11] Kryszkiewicz, M., Rough set approach to incomplete information systems. Inf. Sci. 112:1 (1998), 39–49.
12. [12] Marek, V.W., Pawlak, Z., Information storage and retrieval systems: mathematical foundations. Theor. Comput. Sci. 1 (1976), 331–354.
13. [13] Marek, V.W., Truszczyński, M., Contributions to the theory of rough sets. Fundam. Inform. 39 (1999), 389–409.
14. [14] Orłowska, E., Logical aspects of learning concepts. Int. J. Approx. Reason. 2 (1988), 349–364.
15. [15] Pawlak, Z., Mathematical foundations of information retrieval. Research Report CC PAS Report 101, 1973, Computation Center, Polish Academy of Sciences.
16. [16] Pawlak, Z., Rough sets. Int. J. Comput. Inf. Sci. 11:5 (1982), 341–356.
17. [17] Pawlak, Z., Rough Sets: Theoretical Aspects of Reasoning about Data. 1991, Kluwer Academic Publishers, Boston.
18. [18] Pomykala, J.A., Approximation operations in approximation space. Bull. Acad. Pol. Sci. 35:9–10 (1987), 653–662.
19. [19] Restrepo, M., Cornelis, C., Gómez, J., Duality, conjugacy and adjointness of approximation operators in covering based rough sets. Int. J. Approx. Reason. 55 (2014), 469–485.
20. [20] Restrepo, M., Cornelis, C., Gómez, J., Partial order relation for approximation operators in covering-based rough sets. Inf. Sci. 284 (2014), 44–59.
21. [21] Samanta, P., Chakraborty, M.K., Covering based approaches to rough sets and implication lattices. Proceedings of the Twelfth International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing Lect. Notes Comput. Sci. (LNAI), vol. 5908, 2009, 127–134.
22. [22] Słowinski, R., Vanderpooten, D., A generalized definition of rough approximation based on similarity. IEEE Trans. Knowl. Data Eng. 12 (2000), 331–336.
23. [23] Słowiński, R., Greco, S., Matarazzo, B., Rough set based decision support. Burke, E.K., Kendall, G., (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, 2005, Springer-Verlag, New York, 475–527.
24. [24] Tsang, E., Chen, D., Lee, J., Yeung, D.S., On the upper approximations of covering generalized rough sets. Proceedings of the 3rd International Conference on Machine Learning and Cybernetics, 2004, 4200–4203.
25. [25] Wu, W.Z., Zhang, W.X., Neighborhood operators systems and approximations. Inf. Sci. 144 (2002), 201–207.
26. [26] Xu, Z., Wang, Q., On the properties of covering rough sets model. J. Henan Norm. Univ. Nat. Sci. 33:1 (2005), 130–132.
27. [27] Xu, W., Zhang, W., Measuring roughness of generalized rough sets induced by a covering. Fuzzy Sets Syst. 158 (2007), 2443–2455.
28. [28] Yao, J.T., Ciucci, D., Zhang, Y., Generalized rough sets. Kacprzyk, Pedrycz, (eds.) The Springer Handbook of Computational Intelligence, 2015, Springer, 413–424 (Chapter 25).
29. [29] Yao, Y.Y., Lin, T.Y., Generalization of rough sets using modal logic. Intell. Autom. Soft Comput. 2:2 (1996), 103–120.
30. [30] Yao, Y.Y., Relational interpretations of neighborhood operators and rough set approximation operators. Inf. Sci. 101 (1998), 21–47.
31. [31] Yao, Y.Y., Liau, C.J., A generalized decision logic language for granular computing. The 2002 IEEE World Congress on Computational Intelligence, FUZZ-IEEE'02, 2002, 1092–1097.
32. [32] Yao, Y.Y., A note on definability and approximations. Transactions on Rough Sets, VII Lect. Notes Comput. Sci., vol. 4400, 2007, 274–282.
33. [33] Yao, Y.Y., Zhou, B., A logic language of granular computing. Proceedings of the 6th IEEE International Conference on Cognitive Informatics, 2007, 178–185.
34. [34] Yao, Y.Y., Miao, D., Zhang, N., Xu, F., Set-theoretic approaches to granular computing. Fundam. Inform. 115 (2012), 247–264.
35. [35] Yao, Y.Y., Yao, B., Covering based rough sets approximations. Inf. Sci. 200 (2012), 91–107.
36. [36] Yao, Y.Y., The two sides of the theory of rough sets. Knowl.-Based Syst. 80 (2015), 67–77.
37. [37] Yao, Y.Y., Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis. Inf. Sci. 346 (2016), 442–462.
38. [38] Żakowski, W., Approximations in the space (u,π). Demonstr. Math. 16 (1983), 761–769.
39. [39] Zhu, W., Wang, F., Reduction and axiomatization of covering generalized rough sets. Inf. Sci. 152 (2003), 217–230.
40. [40] Zhu, W., Wang, F., On three types of covering based rough sets. IEEE Trans. Knowl. Data Eng., 8, 2007.
41. [41] Zhu, W., Relationship between generalized rough sets based on binary relation and covering. Inf. Sci. 179 (2009), 210–225.