Advertisement

Irredundant Coverings, Tolerances, and Related Algebras

  • Jouni JärvinenEmail author
  • Sándor Radeleczki
Chapter
Part of the Trends in Mathematics book series (TM)

Abstract

This chapter deals with rough approximations defined by tolerance relations that represent similarities between the elements of a given universe of discourse. We consider especially tolerances induced by irredundant coverings of the universe U. This is natural in view of Pawlak’s original theory of rough sets defined by equivalence relations: any equivalence E on U is induced by the partition UE of U into equivalence classes, and UE is a special irredundant covering of U in which the blocks are disjoint. Here equivalence classes are replaced by tolerance blocks which are maximal sets in which all elements are similar to each other. The blocks of a tolerance R on U always form a covering of U which induces R, but this covering is not necessarily irredundant and its blocks may intersect. In this chapter we consider the semantics of tolerances in rough sets, and in particular the algebraic structures formed by the rough approximations and rough sets defined by different types of tolerances.

Notes

Acknowledgements

We would like to thank our second reader Magnus Steinby for the effort he has put in to provide expert views on our original manuscript. His many valuable comments and suggestions have veritably improved the quality of this work.

References

  1. 1.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)zbMATHGoogle Scholar
  2. 2.
    Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)CrossRefGoogle Scholar
  3. 3.
    Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Berlin/Heidelberg (1999)CrossRefGoogle Scholar
  4. 4.
    Grätzer, G.: General Lattice Theory, 2nd edn. Springer, Berlin (1998)zbMATHGoogle Scholar
  5. 5.
    Iwiński, T.B.: Algebraic approach to rough sets. Bull. Pol. Acad. Sci. Math. 35, 673–683 (1987)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Järvinen, J.: Knowledge representation and rough sets. Ph.D. dissertation, Department of Mathematics, University of Turku, Finland (1999). TUCS Dissertations 14Google Scholar
  7. 7.
    Järvinen, J.: Lattice theory for rough sets. Trans. Rough Sets VI, 400–498 (2007)Google Scholar
  8. 8.
    Järvinen, J., Radeleczki, S.: Rough sets determined by tolerances. Int. J. Approx. Reason. 55, 1419–1438 (2014)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Järvinen, J., Radeleczki, S.: Tolerances induced by irredundant coverings. Fund. Inform. 137, 341–353 (2015)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Järvinen, J., Radeleczki, S.: Representing regular pseudocomplemented Kleene algebras by tolerance-based rough sets. J. Aust. Math. Soc. 105(1), 57–78 (2018). https://doi.org/10.1017/S1446788717000283 MathSciNetCrossRefGoogle Scholar
  11. 11.
    Katrin̆ák, T.: The structure of distributive double p-algebras. Regularity and congruences. Algebra Univers. 3, 238–246 (1973)Google Scholar
  12. 12.
    Kryszkiewicz, M.: Rough set approach to incomplete information systems. Inf. Sci. 112, 39–49 (1998)MathSciNetCrossRefGoogle Scholar
  13. 13.
    McKinsey, J.C.C., Tarski, A.: The algebra of topology. Ann. Math. 45, 141–191 (1944)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Monteiro, A.: Sur les algèbres de Heyting symétriques. Port. Math. 39, 1–237 (1980)zbMATHGoogle Scholar
  15. 15.
    Pawlak, Z.: Information systems theoretical foundations. Inf. Syst. 6, 205–218 (1981)CrossRefGoogle Scholar
  16. 16.
    Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11, 341–356 (1982)CrossRefGoogle Scholar
  17. 17.
    Pomykała, J.A.: Some remarks on approximation. Demonstratio Math. XXIV, 95–104 (1991)Google Scholar
  18. 18.
    Schreider, J.A.: Equality, Resemblance, and Order. Mir Publishers, Moscow (1975)Google Scholar
  19. 19.
    Varlet, J.: A regular variety of type 〈2, 2, 1, 1, 0, 0〉. Algebra Univers. 2, 218–223 (1972)MathSciNetCrossRefGoogle Scholar
  20. 20.
    Yao, Y.Y.: Concept lattices in rough set theory. In: Proceedings of the 23rd International Meeting of the North American Fuzzy Information Processing Society, pp. 796–801 (2004)Google Scholar
  21. 21.
    Żakowski, W.: Approximations in the space (U, Π). Demonstratio Math. 16, 761–769 (1983)Google Scholar
  22. 22.
    Zeeman, E.C.: The topology of the brain and visual perception. In: Fort, J.M.K. (ed.) Topology of 3-Manifolds. Prentice-Hall, Englewood Cliffs (1962)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Mathematics and StatisticsUniversity of TurkuTurkuFinland
  2. 2.Institute of MathematicsUniversity of MiskolcMiskolc-EgyetemvárosHungary

Personalised recommendations