Skip to main content

Concept Lattices of Incomplete Data

  • Conference paper

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

Abstract

We present a method of constructing a concept lattice of a formal context with incomplete data. The lattice reduces to a classical concept lattice when the missing values are completed. The lattice also can reflect any known dependencies between the missing values. We show some experiments indicating that in most cases, when the number of missing values is not large, the size of the incomplete concept lattice is not substantially greater than the size of the concept lattice of completed data.

Supported by grant no. P103/10/1056 of the Czech Science Foundation.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belohlavek, R.: Concept lattices and order in fuzzy logic. Ann. Pure Appl. Log. 128(1-3), 277–298 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belohlavek, R.: Fuzzy Relational Systems: Foundations and Principles. Kluwer Academic Publishers, Norwell (2002)

    MATH  Google Scholar 

  3. Bělohlávek, R., Sklenář, V., Zacpal, J.: Crisply Generated Fuzzy Concepts. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 269–284. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Belohlavek, R., Vychodil, V.: Reducing the size of fuzzy concept lattices by hedges. In: Proceedings of FUZZ-IEEE 2005: The 14th IEEE International Conference on Fuzzy Systems, pp. 663–668 (2005)

    Google Scholar 

  5. Burmeister, P., Holzer, R.: On the Treatment of Incomplete Knowledge in Formal Concept Analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, pp. 385–398. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

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

    Google Scholar 

  7. Gratzer, G.A.: General lattice theory. Academic Press, New York (1978)

    Google Scholar 

  8. Obiedkov, S.: Modal Logic for Evaluating Formulas in Incomplete Contexts. In: Priss, U., Corbett, D., Angelova, G. (eds.) ICCS 2002. LNCS (LNAI), vol. 2393, pp. 314–325. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Rival, I. (ed.) Ordered Sets, Boston, pp. 445–470 (1982)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krupka, M., Lastovicka, J. (2012). Concept Lattices of Incomplete Data. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds) Formal Concept Analysis. ICFCA 2012. Lecture Notes in Computer Science(), vol 7278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29892-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29892-9_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29891-2

  • Online ISBN: 978-3-642-29892-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics