Algorithms for the Construction of Concept Lattices and Their Diagram Graphs

  • Sergei O. Kuznetsov
  • Sergei A. Obiedkov
Conference paper

DOI: 10.1007/3-540-44794-6_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2168)
Cite this paper as:
Kuznetsov S.O., Obiedkov S.A. (2001) Algorithms for the Construction of Concept Lattices and Their Diagram Graphs. In: De Raedt L., Siebes A. (eds) Principles of Data Mining and Knowledge Discovery. PKDD 2001. Lecture Notes in Computer Science, vol 2168. Springer, Berlin, Heidelberg

Abstract

Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparsity of underlying formal contexts.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Sergei O. Kuznetsov
    • 1
  • Sergei A. Obiedkov
    • 2
  1. 1.All-Russia Institute for Scientific and Technical Information (VINITI)MoscowRussia
  2. 2.Russian State University for the HumanitiesMoscowRussia

Personalised recommendations