Skip to main content
Conference ProceedingsOPEN ACCESS

Algorithms for the construction of concept lattices and their diagram graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2168 289-300
DOI: 10.1007/3-540-44794-6_24
33Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Kuznetsov, S. O., & Obiedkov, S. A. (2001). Algorithms for the construction of concept lattices and their diagram graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2168, pp. 289–300). Springer Verlag. https://doi.org/10.1007/3-540-44794-6_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free