Faster Algorithms for Constructing a Concept (Galois) Lattice
离散数学
2007-05-23 v2 数据结构与算法
摘要
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.
引用
@article{arxiv.cs/0602069,
title = {Faster Algorithms for Constructing a Concept (Galois) Lattice},
author = {Vicky Choi},
journal= {arXiv preprint arXiv:cs/0602069},
year = {2007}
}
备注
15 pages, 3 figures