Approximations and rough sets based on tolerances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2005, Issue , 2001, Pages 182-189

  Järinen, Jouni ^a  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY;

DEFINABLE SETS; INDISCERNIBILITY RELATION; TOLERANCE RELATIONS;

ROUGH SET THEORY;

EID: 84957803991     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45554-X_21     Document Type: Conference Paper

References (21)

1. B. A. Davey, H. A. Priestley, Introduction to Lattices and Order, Cambridge University Press, Cambridge, 1990.
2. B. Ganter, R. Wille, Formal Concept Analysis. Mathematical Foundations (translated from the 1996 German original by Cornelia Franzke), Springer-Verlag, Berlin, 1999.
3. M. Gehrke, E. Walker, On the Structure of Rough Sets, Bulletin of the Polish Academy of Sciences, Mathematics 40 (1992), pp 235-245.
4. T. B. Iwinski, Algebraic Approach to Rough Sets, Bulletin of the Polish Academy of Sci- cnccs, Mathematics 35 (1987), pp 673-683.
5. J. Järvinen, Preimage Relations and Their Matrices, in [16], pp 139-146.
6. J. Järvinen, Knowledge Representation and Rough Sets, Doctoral Dissertation, University of Turku, March 1999 (available at http://www.cs.utu.fi/jjarvine/thesis).
7. B. Konikowska, A Logic for Reasoning about Relative Similarity, Studia Logica 58 (1997), pp 185-226.
8. S. Marcus, The Paradox of the Heap of Grains in Respect to Roughness, Fuzziness and Negligibility, in 116], pp 19-23.
9. J. Nieminen Rough. Tolerance Equality and Tolerance Black Boxes, Fundamenta Informat- icac 11 (1988), pp 289-296.
10. M. Novotný, Z. Pawlak, Characterization of Rough Top Equalities and Rough Bottom Equalities, Bulletin of the Polish Academy of Sciences, Mathematics 33 (1985), pp 92-97.
11. M. Novotny, Z. Pawlak, On Rough Equalities, Bulletin of the Polish Academy of Sciences, Mathematics 33 (1985), pp 98-113.
12. O. Ore, Galois Connexions, Transactions of American Mathematical Society 55 (1944), pp 493-513.
13. E. Orlowska, Logic of Nondeterministic Information, Studia Logica XLIV (1985), pp 93102.
14. Z. Pawlak, Information Systems. Theoretical Foundations, Informations Systems 6 (1981), pp 205-218.
15. Z. Pawlak, Rough Sets, International Journal of Computer and Information Scicnccs 5 (1982), pp 341-356.
16. L. Polkowski, A. Skowron (eds.), Rough Sets and Current Trends in Computing, Lecture Notes in Artificial Intelligence 1424, Springer-Verlag, Berlin/Heidelberg, 1998.
17. J. A. Pomykala, On Definability in the Nondeterministic Information System, Bulletin of the Polish Academy of Sciences, Mathematics 36 (1988), pp 193-210.
18. J. A. Pomykala, On Similarity Based Approximation of Information, Demonstratio Math- ematica XXVII (1994), pp 663-671.
19. A. Skowron, J. Stepaniuk, Tolerance Approximation Spaces, Fundamenta Informaticac 27 (1996), pp 245-253.
20. M. Steinby, Karkeat joukot ja epataydellinen tieto (Rough Sets and Incomplete Knowledge, in Finnish). In J. Palomakt, I. Koskinen (eds.), Tiedon esittamisesta, Filosofisia tutkimuksia Tampereen yliopistosta 62, Tampere, pp 1-21, 1997.
21. W. Zakowski, Approximations in the Space (U, IT), Demonstratio Mathcmatica 16 (1983), pp 761-769.