Skip to main content
SpringerLink
Log in

Formal Concepts in Dedekind Categories

  • Conference paper
Relations and Kleene Algebra in Computer Science (RelMiCS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4988))

Included in the following conference series:

Abstract

Formal concept analysis is a mathematical field applied to data mining. Usually, a formal concept is defined as a pair of sets, called extents and intents, for a given formal context in binary relation. In this paper we set a relational formulation for formal concepts, and prove some basic properties of concept lattices by using relation calculus in Dedekind categories.

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. Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  2. Berghammer, R.: Computation of cut completions and concept lattices using relational algebra and relview. Journal on Relational Methods in Computer Science 1, 50–72 (2004)

    Google Scholar 

  3. Freyd, P.J., Scedrov, A.: Categories, Allegories. North-Holland, Amsterdam (1990)

    MATH  Google Scholar 

  4. Olivier, J.P., Serrato, D.: Catégories de dedekind. morphismes dans les catégories de schröder. C. R. Acad. Sci. Paris 260, 939–941 (1980)

    MathSciNet  Google Scholar 

  5. Schmidt, G., Ströhlein, T.: Relations and graphs – Discrete Mathematics for Computer Science –. Springer, Heidelberg (1993)

    Google Scholar 

  6. Tarski, A.: On the calculus of relations. Journal of Symbolic Logic 6, 73–89 (1941)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kawahara, Y.: Urysohn’s lemma in schröder categories. Bull. Inform. Cybernet 39, 69 (2007)

    MathSciNet  Google Scholar 

  8. Kawahara, Y.: Theory of relations. Lecture note (japanese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Kyushu University, Fukuoka, 819-0395, Japan

    Toshikazu Ishida, Kazumasa Honda & Yasuo Kawahara

Authors
  1. Toshikazu Ishida
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kazumasa Honda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yasuo Kawahara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudolf Berghammer Bernhard Möller Georg Struth

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishida, T., Honda, K., Kawahara, Y. (2008). Formal Concepts in Dedekind Categories. In: Berghammer, R., Möller, B., Struth, G. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2008. Lecture Notes in Computer Science, vol 4988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78913-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-78913-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-78912-3

  • Online ISBN: 978-3-540-78913-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation