Advertisement

Eliciting the Most Desirable Information with Residuated Lattices

  • Sylvia Encheva
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 269)

Abstract

Current technologies for collecting and storing data allow users to gather it without been too much concern about devices’ capacities. At the same time a very serious question on how to extract significant knowledge from available datasets remains quite open. One non trivial attempt to provide an adequate answer involves residuated lattices.

Keywords

Residuated lattices Concept lattices Evaluation 

References

  1. 1.
    Wille R (1985) Complete tolerance relations of concept lattices. In: Eigenthaler G et al (eds) Contributions to general algebra, vol 3, pp 397–415Google Scholar
  2. 2.
    Carpineto C, Romano G (2004) Concept data analysis: theory and applications. Wiley, ChichesterCrossRefGoogle Scholar
  3. 3.
    Davey BA, Priestley HA (2005) Introduction to lattices and order. Cambridge University Press, CambridgeGoogle Scholar
  4. 4.
    Ganter B, Wille R (1999) Formal concept analysis—mathematical foundations. Springer, BerlinGoogle Scholar
  5. 5.
    Czedli G (1982) Factor lattices by tolerances. Acta Sci Math 44:35–42MATHMathSciNetGoogle Scholar
  6. 6.
    Meschke C (2010) Approximations in concept lattices. In: Kwuida L, Sertkaya B (eds) Formal concept analysis, Lecture notes in computer science, vol 5986. Springer, Berlin, pp 104–123Google Scholar
  7. 7.
    Ward M, Dilworth RP (1939) Residuated lattices. Trans Am Math Soc 45:335–354CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Stord/Haugesund University CollegeHaugesundNorway

Personalised recommendations