Skip to main content
SpringerLink
Log in

Approximations in Concept Lattices

  • Conference paper
Book cover Formal Concept Analysis (ICFCA 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5986))

Included in the following conference series:

Abstract

Motivated by Rough Set Theory we describe an interval arithmetic on complete lattices. Lattice elements get approximated by approximations which are pairs consisting of a lower and an upper approximation. The approximations form a complete lattice again. We describe these lattices of approximations by formal contexts. Furthermore, we interpret the result for concept lattices as restricting the scope to a subcontext of interesting objects and attributes.

Supported by the DFG research grant no. GA 216/10-1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  2. Ganter, B.: Lattices of Rough Set Abstractions as P-Products. In: Medina, R., Obiedkov, S. (eds.) ICFCA 2008. LNCS (LNAI), vol. 4933, pp. 199–216. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  4. Ganter, B.: Relational galois connections. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 1–17. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Meschke, C.: Robust Elements in Rough Set Abstractions. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol. 5548, pp. 114–129. Springer, Heidelberg (2009)

    Google Scholar 

  6. Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra, TU Dresden, Germany

    Christian Meschke

Authors
  1. Christian Meschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, Zurich University of Applied Sciences, Technikumstraße 9, 8401, Winterthur, Switzerland

    Léonard Kwuida

  2. SAP Research Center, Chemnitzer Straße 48, 01187, Dresden, Germany

    Barış Sertkaya

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meschke, C. (2010). Approximations in Concept Lattices. In: Kwuida, L., Sertkaya, B. (eds) Formal Concept Analysis. ICFCA 2010. Lecture Notes in Computer Science(), vol 5986. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11928-6_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11928-6_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11927-9

  • Online ISBN: 978-3-642-11928-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation