Comparing performance of algorithms for generating concept lattices

Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown 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/sparseness of underlying formal contexts. Principles of comparing practical performance of algorithms are discussed.

• Type: Journal
• Year: 2002
• Where: JETAI
• Authors: Sergei O. Kuznetsov, Sergei A. Obiedkov
• Keywords: Algorithms, JETAI 2002, Several Algorithms, Wellknown Algorithms