Comparing performance of algorithms for generating concept lattices

2002/04/01 by Sergei O. Kuznetsov, Sergei Obiedkov · 3 citations
Computer Science · #Rough Sets and Fuzzy Logic #Data Mining Algorithms and Applications #Data Management and Algorithms #Computer science #Algorithm #Lattice Miner #Set (abstract data type) #Formal concept analysis #Theoretical computer science

paper · doi:10.1080/09528130210164170

openalex publication_date 2002/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

Recently concept lattices became widely used tools for intelligent data analysis. In this paper, 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.

Citations

• On generating all maximal independent sets

Cited by

• Discovery data topology with the closure structure. Theoretical and practical aspects
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Formal concept analysis [wikipedia]