2006/02/19 by Vicky Choi, Choi, Vicky · 1 citation
Computer Science · #Advanced Computational Techniques and Applications #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.cs/0602069
openalex publication_date 2006/02/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.