Formal concepts in dedekind categories

  • Authors:

  • Toshikazu Ishida;Kazumasa Honda;Yasuo Kawahara

  • Affiliations:

  • Department of Informatics, Kyushu University, Fukuoka, Japan;Department of Informatics, Kyushu University, Fukuoka, Japan;Department of Informatics, Kyushu University, Fukuoka, Japan

  • Venue:
  • RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
  • Year:
  • 2008

  • Armstrong's Inference Rules in Dedekind Categories

    RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science

  • Point axioms in dedekind categories

    RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science

Quantified Score

Hi-index 0.00

Visualization

Abstract

Formal concept analysis is amathematical 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.