Faster Algorithms for Constructing a Concept (Galois) Lattice

TL;DR

This paper introduces faster algorithms for constructing concept lattices and frequent closed itemset lattices, significantly improving efficiency over existing methods by leveraging lattice structure.

Contribution

The paper presents novel, faster algorithms for concept lattice construction, including variants optimized for specific tasks like frequent closed itemset lattices.

Findings

Algorithms outperform existing methods in speed

Efficiency depends on lattice structure

Applicable to frequent closed itemset lattices

Abstract

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for computing all concepts only, and one for constructing a frequent closed itemset lattice. The running time of our algorithms depends on the lattice structure and is faster than all other existing algorithms for these problems.