Foundations of rough sets from vagueness perspective

Rough Computing: Theories, Technologies and Applications

Volumn , Issue , 2007, Pages 1-37

  Wasilewski, Piotr ^a   Ślezak, Dominik ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b INFOBRIGHT INC   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858440879     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-59904-552-8.ch001     Document Type: Chapter

References (123)

1. Alexandroff, P. (1937). Diskrete räume. Matematičeskij Sbornik, 2, 501-518.
2. Banerjee M., & Chakraborty, M. (1993). Rough algebra. Bulletin of the Polish Academy of Sciences, Mathematics, 41(4), 293-297.
3. Banerjee M., & Chakraborty, M. (1996). Rough sets through algebraic logic. Fundamenta Informaticae, 28(3-4), 211-221.
4. Banerjee M., & Chakraborty, M. (2003). Algebras from rough sets. In S. K. Pal, L. Polkowski, & A. Skowron, (Eds.), Rough-neural computing: Techniques for computing with words (pp 157-184). Heidelberg, Germany: Springer Verlag.
5. Bazan, J., Skowron, A., & Swiniarski, R., (2006). Rough sets and vague concepts approximations: From sample approximation to adaptative learning. Transactions on Rough Set, V, Journal. Subline, Lectures Notes in Computer Science, 4100 (pp. 39-63).
6. st ed.). Providence, RI: Colloquium Publications XXV, American Mathematical Society.
7. rd ed.). Providence, RI: Colloquium Publications XXV, American Mathematical Society.
8. Bonikowski, Z. (1994). Algebraic structures of rough sets. In Rough sets, fuzzy sets and knowledge discovery (RSKD'93). Workshops in computing (pp. 242-247). Berlin, London: Springer-Verlag and British Computer Society.
9. Burris, S., & Sankappanavar, H. P. (1981). A course in universal algebra. Berlin-Heidelberg, Germany: Springer-Verlag.
10. Cattaneo, G. (1997). Generalized rough sets. Preclusivity fuzzy-intuitionistic (BZ) lattices. Studia Logica, 58, 47-77.
11. Cattaneo, G. (1998). Abstract approximation spaces for rough theories. In L. Polkowski, & A. Skowron, (Eds.). Rough sets in knowledge discovery (pp. 59-98). Heidelberg: Physica-Verlag.
12. Chuchro, M. (1994). On rough sets in topological Boolean algebras. In W. Ziarko (Ed.), Rough sets, fuzzy sets and knowledge discovery. Proceedings of the International Workshop on Rough Sets and Knowledge Discovery (RSKD'93) (pp. 157-160). Berlin, Heidelberg: Springer-Verlag.
13. Comer, S. (1991). An algebraic approach to the approximation of information. Fundamenta Informaticae, 14, 492-502.
14. Comer, S. (1995). Perfect extensions of regular double Stone algebras. Algebra Universalis, 34, 96-109.
15. Davey, B.A., & Priestley, H.A. (2001). Introduction to lattices and order. Cambridge, UK: Cambridge University Press.
16. Demri, S. (1999). A logic with relative knowledge operators. Journal of Logic, Language and Information, 8(2), 167-185.
17. Demri, S. (2000). The nondeterministic information logic NIL is PSPACE-complete. Fundamenta Informaticae, 42(3-4), 211-234.
18. Demri, S., & Orłowska, E. (1998). Informational representability of models for information logics. In E. Orłowska (Ed.). Incomplete information: Rough set analysis (pp. 383-409). Heidelberg, Germany, New York: Springer-Verlag.
19. Demri, S., & Orłowska, E. (2002). Incomplete information: Structures, inference, complexity. Berlin, Heidelberg, Germany: Springer-Verlag.
20. Dubois, D., Godo, L., Prade, H., & Esteva, F. (2005). An information-based discussion of vagueness. In H. Cohen, C. Lefebvre (Eds.), Handbook of Categorization in cognitive science (pp. 892-913). Elsevier.
21. Düntsch, I. (1997). A logic for rough sets. Theoretical Computer Science, 179, 427-436.
22. Frege, G. (1903). Grundgesetzen der Arithmetik, 2. Jena, Germany: Verlag von Herman Pohle.
23. Düntsch, I., & Gediga, G. (1997). Algebraic aspects of attribute dependencies in information systems. Fundamenta Inforamticae, 29, 119-133.
24. Düntsch, I., & Gediga, G. (2000). Rough set data analysis: A road to non-invasive knowledge discovery. Bangor, UK: Methodos Publishers.
25. Düntsch, I., & Orłowska, E. (2001). Boolean algebras arising from information systems. Proceedings of the Tarski Centenary Conference, Banach Centre, Warsaw, June 2001. Annals of Pure and Applied Logic, 217(1-3), 77-89.
26. Gehrke, M., & Walker, E. (1992). On the structure of rough sets. Bulletin of the Polish Academy of Sciences, Mathematics, 40, 235-245.
27. Gratzer, G. (1971). Lattice theory: First concepts and distirbutive lattices. San Francisco: W. H. Freeman and Company.
28. Gratzer, G. (1978). General lattice theory. Basel, Switzerland: Birkhauser.
29. Greco, A., Matarazzo, B., & Słowiński, R. (2002). Rough approximation by dominance relations. International Journal of Intelligent Systems, 17, 153-171.
30. rd International Conference (RSCTC'2002). Lectures Notes in Artificial Intelligence, 2475 (pp. 93-104). Berlin, Heildelberg, Germany: Springer-Verlag.
31. Grzymała-Busse, J. W. (1988). Knowledge acquisition under uncertainty - A rough set approach. Journal of Intelligent and Robotic Systems, 1(1), 3-16.
32. nd International Conference on Rough Sets and Current Trends in Computing (RSCTC'2000). Lectures Notes in Artificial Intelligence, 2005 (pp. 340-347). Heildelber, Germany: Springer-Verlag.
33. th International Conference of the Decision Sciences Institute (ICDCI'99) (pp. 1377-1379). Athens, Greece.
34. Grzymała-Busse, J.W., & Stefanowski, J. (2001). Three discretization methods for rule induction. International Journal of Intelligent Systems, 16(1), 29-38.
35. Grzymała-Busse, J.W., Stefanowski, J., & Ziarko, W. (1996). Rough sets: Facts versus misconceptions. Informatica, 20, 455-465.
36. Hempel, C.G. (1939). Vagueness and logic. Philosophy of Science, 6, 163-180.
37. Inuiguchi, M., Hirano, S., & Tsumoto, S. (Eds.). (2003). Rough set theory and granular computing. Berlin, Heidelberg, Germany: Springer Verlag.
38. Iwiński, T. B. (1987). Algebraic approach to rough sets. Bulletin of the Polish Academy of Sciences, Mathematics, 35, 673-683.
39. Järvinen, J. (1999). Knowledge representation and rough sets. Doctoral dissertation. University of Turku: Turku Center for Computer Science.
40. Järvinen, J. (2006). Lattice theory of rough sets. Unpublished manuscript.
41. Katriniak, T. (1973). The structure of distributive double p-algebras. Regularity and Congruences. Algebra Universalis, 3, 238-246.
42. Keefe, R. (2000). Theories of vagueness. Cambridge, UK: Cambridge University Press.
43. Kondrad, E., Orłowska, E., & Pawlak, Z. (1981). Knowledge representation systems. Technical Report 433, Institute of Computer Science, Polish Academy of Sciences.
44. Koppelberg, S. (1989). General theory of Boolean algebras. In J.D. Monk & R. Bonett (Eds.), Handbook of Boolean algebras. Amsterdam: North Holland.
45. Lin, T.Y. (1998). Granular computing on binary relations. I: Data mining and neighborhood systems. In L. Polkowski & A. Skowron, (Eds.). Rough sets in knowledge discovery (pp. 107-121). Heidelberg: Physica-Verlag.
46. Lin, T.Y. (1998). Granular computing on binary relations. II: Rough sets representations and belief functions. In L. Polkowski & A. Skowron (Eds.), Rough sets in knowledge discovery (pp. 121-140). Heidelberg: Physica-Verlag.
47. Lin, T.Y. (1999). Granular computing: Fuzzy logic and rough sets. In L.A. Zadeh & J. Kacprzyk (Eds.), Computing with words in information/intelligent systems (pp.183-200). Berlin, Heidelberg, Germany: Springer-Verlag.
48. Lin, T.Y. (2006). A roadmap from rough set theory to granular computing. In G. Wang, J.F. Peters, A. Skowron, & Y.Y. Yao (Eds.), Rough sets and knowledge technology. Proceedings of the First International Conference, RSKT2006, Chonging China. Lectures Notes in Computer Science, 4062 (pp. 33-41). Berlin, Heidelberg, Germany: Springer-Verlag.
49. Lin, T.Y., & Cercone, N. (Eds.). (1997). Rough sets and data mining. Dodrecht: Kluwer Academic Publisher.
50. rd International Symposium on Automata, Languages and Programming (pp. 120-130). Edinburgh, Scotland.
51. McKinsey, J.C.C., & Tarski, A. (1946). On closed elements in closure algebras. The Annals of Mathematics, 47, 122-162.
52. th International Conference, Regina, Canada (RSFDGrC 2005), Lectures Notes in Artificial Intelligence 3641 (pp. 325-334). Berlin, Heidelberg: Springer-Verlag.
53. st International Conference (RSCTC'98), Warsaw, Poland. Lectures Notes in Artificial Intelligence, 1424 (pp. 545-552). Berlin, Heidelberg, Germany: Springer-Verlag.
54. Obtułowicz, A. (1987). Rough sets and Heyting algebra valued sets. Bulletin of the Polish Academy of Sciences, Mathematics, 35(9-10), 667-671.
55. Orłowska, E. (1988). Representation of vague information. Information Systems, 13, 167-174.
56. Orłowska, E. (1989). Logic for reasoning about knowledge. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik, 35, 559-568.
57. Orłowska, E. (1993a). Reasoning with incomplete information: Rough set based information logics. In V. Algar, S. Bergler, & F.Q. Dong (Eds.), Incompleteness and Uncertainty in Information Systems Workshop (pp. 16-33). Berlin, Springer-Verlag.
58. nd International Workshop on Rough Sets and Knowledge Discovery, Banff, Canada (pp. 143-148).
59. Orłowska, E. (1995). Information algebras. In V. S. Alagar, & M. Nivat (Eds.), Algebraic methodology and software technology, Lectures Notes in Computer Science, 936 (pp. 50-65).
60. Orłowska, E. (1997). Studying incompleteness of information: A class of information logics. In K. Kijania-Placek & J. Woleński (Eds.), The Lvov-Warsaw School and contemporary philosophy (pp. 303-320). Dordrecht: Kluwer Academic Publishers.
61. Orłowska, E. (Ed.). (1998a). Incomplete information: Rough set analysis. Heidelberg, Germany, New York: Springer-Verlag.
62. Orłowska, E. (1998b). Introduction: What you always wanted to know about rough sets. In E. Orłowska (Ed.), Incomplete information: Rough set analysis (pp. 1-20). Heidelberg, Germany, New York: Springer-Verlag.
63. Orłowska, E., & Pawlak, Z. (1984). Representation of nondeterministic information. Theoretical. Compter Science, 29, 27-39.
64. Pagliani, P. (1996). Rough sets and Nelson algebras. Fundamenta Inforamticae, 27(2-3), 205-219.
65. Pagliani, P. (1998a). Rough set theory and logicalgebraic structures. In E. Orłowska (Ed.). Incomplete information: Rough set analysis (pp. 109-192). Heidelberg, Germany, New York: Springer-Verlag.
66. Pagliani, P. (1998b). Intrinsic co-Heyting boundaries and information incompleteness in rough set analysis. In L. Polkowski, & A. Skowron, (Eds.), Rough sets and current trends in Computing, 1st International Conference (RSCTC'98), Warsaw, Poland. Lectures Notes in Artificial Intelligence, 1424 (pp. 123-130). Berlin, Heidelberg, Germany: Springer-Verlag.
67. Pal, S.K., Polkowski, L., & Skowron, A. (Eds.), (2004). Rough-neural computing: Techniques for computing with words. Heidelberg, Germany, Springer Verlag.
68. Pawlak, Z. (1973). Mathematical foundations of informational retrieval (Research Report 101). Institute of Computer Science, Polish Academy of Sciences.
69. Pawlak, Z. (1981). Information systems: Theoretical foundations. Information Systems, 6, 205-218.
70. Pawlak, Z. (1982). Rough sets. International Journal of Computer and Information Sciences, 11, 341-356.
71. Pawlak, Z. (1991). Rough sets. Theoretical aspects of reasoning about data. Dodrecht: Kluwer Academic Publisher.
72. Pawlak, Z. (2003). Elementary rough set granules: toward a rough set processor. In S.K. Pal, L. Polkowski, & A. Skowron (Eds.), Roughneural computing: Techniques for computing with words (pp. 5-13). Heidelberg, Germany, Springer Verlag.
73. Pawlak, Z. (2004). Some issues on rough sets. Transactions on Rough Set, I, Journal Subline, Lectures Notes in Computer Science, 3100, 1-58.
74. Peters, J.F. (2007). Near sets. Special theory about nearness of objects. Fundamenta Informaticae, 75, in press.
75. Pogonowski, J. (1981). Tolerance spaces with applications to linguistics. Poznań: Adam Mickiewicz University Press.
76. Polkowski, L. (2002). Rough sets: Mathematical foundations. Heidelberg, Germany: Physica-Verlag.
77. Polkowski, L., & Skowron, A. (1996). Rough mereology: A new paradigm for approximate reasoning. International Journal of Approximate Reasoning, 15, 333-365.
78. st International Conference (RSCTC'98), Warsaw, Poland. Lectures Notes in Artificial Intelligence, 1424. Berlin, Heidelberg, Germany: Springer-Verlag.
79. Polkowski, L., & Skowron, A. (Eds.). (1998b). Rough sets in knowledge discovery. Heidelberg: Physica-Verlag.
80. Polkowski, L., Skowron, A., & Zytkow, J. (1995). Rough foundations for rough sets. In T.Y. Lin, & A.M. Wildberger (Eds.), Soft computing: Rough sets, fuzzy logic, neural networks, uncertainty management, knowledge discovery (pp. 55-58). San Diego, CA: Simulation Councils, Inc.
81. Pomykała, J., & Pomykała, J.A. (1988). The Stone algebra of rough sets. Bulletin of the Polish Academy of Sciences, Mathematics, 36, 451-512.
82. Rasiowa, H., & Sikorski, R. (1970). The mathematics of metamathematics. Warsaw, Poland: Polish Scientific Publisher.
83. Rauszer, C. (1974). Semi-Boolean algebras and their applications to intuitionistic logic with dual operators. Fundamenta Mathematicae, 83, 219-249.
84. Russell, B. (1923). Vagueness. The Australasian Journal of Psychology and Philosophy, 1, 84-92.
85. th International. Conference, Regina, Canada (RSFDGrC 2005). Lectures Notes in Artificial Intelligence, 3641 (pp. 254-264). Berlin, Heidelberg: Springer-Verlag.
86. Skowron, A. (2001). Toward intelligent systems: Calculi of information granules. Bulletin of the International Rough Set Society, 5, 9-30.
87. Skowron, A. (2003). Approximation spaces in rough neurocomputing. In M. Inuiguchi, S. Hirano, S. Tsumoto (Eds.), Rough set theory and granular computing (pp. 13-22). Berlin, Heidel-berg, Germany: Springer Verlag.
88. Skowron, A. (2004). Vague concepts: A rough-set approach. In B. De Beats, R. De Caluwe, G. De Tre, J. Fodor, J. Kacprzyk, & S. Zadrożny (Eds.), Data and knowledge engineering: Proceedings of EUROFUSE2004 (pp. 480-493). Warszawa, Poland: Akademicka Oficyna Wydawnicza EXIT.
89. Skowron, A. (2005). Rough sets and vague concepts. Fundamenta Informaticae, 64, 417-431.
90. Skowron, A., & Rauszer, C. (1991). The discernibility matrices and functions in information systems. In R. Słowiński (Ed.), Intelligent decision support, handbook of applications and advances of the rough set theory (pp. 331-362). Dordrecht, Holland: Kluwer Academic Publisher.
91. Skowron, A., & Stepaniuk, J. (1996). Tolerance approximation spaces. Fundamenta Informaticae, 27, 245-253.
92. Skowron, A., & Stepaniuk, J. (2003). Informational granules and rough-neural computing. In S. K. Pal, L. Polkowski, A. Skowron (Eds.), Rough-neural computing: Techniques for computing with words (pp. 43-84). Heidelberg, Germany, Springer Verlag.
93. Skowron, A., Stepaniuk, J., & Peters, J.F. (2003). Towards discovery of relevant patterns from parametrized schemes of information granule construction. In M. Inuiguchi, S. Hirano, & S. Tsumoto (Eds.), Rough set theory and granular computing (pp. 97-108). Berlin, Heidelberg, Germany: Springer Verlag.
94. Skowron, A., Stepaniuk, J., Peters, J.F., & Swiniarski, R. (2006). Calculi of approxiamtion spaces. Fundamenta Informaticae, 72, 363-378.
95. Ślezak, D. (1999). Decomposition and synthesis of decision tables with respect to generalized decision functions. In S.K. Pal, & A. Skowron, (Eds.), Rough fuzzy hybridization - A new trend in decision making. Berlin, Heidelberg, Germany: Springer-Verlag.
96. Ślezak, D. (2002). Approximate entropy reducts. Fundamenta Informaticae, 53(3-4), 365-390.
97. Ślezak, D. (2003). Approximate Markov boundaries and Bayesian Networks: Rough set approach. In M. Inuiguchi, S. Hirano, & S. Tsumoto (Eds.), Rough set theory and granular computing (pp. 109-121). Berlin, Heidelberg, Germany: Springer Verlag.
98. Śle{ogonek}zak, D. (2005). Rough sets and Bayes factor. Transactions on Rough Set, III, Journal Subline, Lectures Notes in Computer Science, 3400, 202-229.
99. Śle{ogonek}zak, D., & Wasilewski, P. (in preparation). Granular sets. Unpublished manuscript.
100. Słowiński, R. (Ed.). (1992). Intelligent decision support, Handbook of applications and advances of the rough set theory. Dordrecht, Holland: Kluwer Academic Publisher.
101. Słowiński, R., & Stefanowski, J. (1989). Rough classification in incomplete information systems. Mathematical and Computer Modelling, 12(10-11), 1347-1357.
102. Słowiński, R., & Stefanowski, J. (1994). Handling various types of uncertainty in the rough set approach. In W. Ziarko (Ed.), Rough Sets, Fuzzy Sets and Knowledge Discovery. Proceedings of the International Workshop on Rough Sets and Knowledge Discovery (RSKD'93) (pp. 366-376). Berlin, Heidelberg: Springer-Verlag.
103. Słowiński, R., & Stefanowski, J. (1996). Rough set reasoning about uncertain data. Fundamenta. Informaticae, 27, 229-243.
104. Słowiński, R., & Vanderpooten, D. (1997). Similarity relation as a basis for rough approximations. In P. P. Wang (Ed.), Machine intelligence and soft computing, IV (pp. 17-33). Raleigh, NC: Bookwrights.
105. Słowiński, R., & Vanderpooten, D. (2000). A generalized definition of rough approximations based on similarity. IEEE Transactions on Data and Knowledge Engineering, 12(2), 331-336.
106. Smith, N.J.J. (2005). Vagueness as closeness. Australasian Journal of Philosophy, 83, 157-183.
107. st International. Conference. (RSCTC'98), Warsaw, Poland. Lectures Notes in Artificial Intelligence, 1424 (pp. 394-401). Berlin, Heidelberg, Germany: Springer-Verlag.
108. Stefanowski, J., & Tsoukias, A. (2001). Incomplete information tables and rough classification. Computational Intelligence: An International Journal, 17(3), 545-566.
109. Stone, P. (1936). The theory of representation for Boolean algebras. Transactions of the American Mathematical Society, 40(1), 37-111.
110. Tarski, A. (1935). Zur Grundlegung der Booleschen Algebra, I. Fundamenta Mathematicae, 24, 177-198.
111. Vakarelov, D. (1989). Modal logics for knowledge representation systems. In A. R. Meyer, & M. Taitslin (Eds.), Symposium on Logic Foundations of Computer Science, Pereslav-Zalessky (pp. 257-277). Lectures Notes in Computer Science, 363. Berlin, Heidelberg, Germany: Springer-Verlag.
112. Vakarelov, D. (1991). A modal logic for similarity relations in Pawlak knowledge representation systems. Fundamenta Informaticae, 15, 61-79.
113. Vakarelov, D. (1998). Information systems, similarity and modal logics. In E. Orłowska (Ed.), Incomplete information: Rough set analysis (pp. 492-550). Heidelbelrg, Germany: Physica-Verlag.
114. Wasilewska, A. (1997). Topological rough algebras. In T. Y. Lin & N. Cercone (Eds.), Rough sets and data mining (pp. 411-425). Dodrecht: Kluwer Academic Publisher.
115. Wasilewski, P. (2004). On selected similarity relations and their applications into cognitive science (in Polish). Unpublished doctoral dis sertation, Department of Logic, Jagiellonian University, Cracow.
116. Wasilewski, P. (2005). Concept lattices vs. approximation spaces. In D. Śle{ogonek}zak G. Wang, M. S. Szczuka, I. Düntsch, & Y.Yao (Eds.), Rough. Sets, Fuzzy Sets, Data Mining, and Granular Computing, 10th International Conference, Regina, Canada (RSFDGrC 2005), Lectures Notes in Artificial Intelligence 3641 (pp. 114-123). Berlin, Heidelberg: Springer-Verlag.
117. rd Annual Computer Science Conference (pp. 61-67). Nashville, TN.
118. nd Annual Joint Conference on Information Sciences (JCIS'95) (pp. 26-30). Raleigh, NC.
119. Yao, Y.Y. (1998a). Constructive and algebraic methods of the theory of rough sets. Information Sciences, 109(1-4), 21-47.
120. Yao, Y.Y. (1998b). Relational interpretations of neighborhood operators and rough set approximation operator. Information Sciences 111(1-4), 239-259.
121. Yao, Y.Y. (2001). Information granulation and rough set approximation. International Journal of Intelligent Systems, 16(1), 87-104.
122. Yao, Y.Y. (2004). A partition model of granular computing. Transactions on Rough Set, I, Journal Subline, Lectures Notes in Computer Science, 3100, 232-253.
123. Ziarko, W. (1993). Variable precision rough set model. Journal of Computer and Systems Sciences, 46, 35-59.