Faster Algorithms for Constructing a Concept (Galois) Lattice

Details Faster Algorithms for Constructing a Concept (Galois) Lattice Faster Algorithms for Constructing a Concept (Galois) Lattice

2006-02-19

arxiv.org/abs/cs/0602069v2

Computer Science

Discrete Mathematics

15 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Faster Algorithms for Constructing a Concept (Galois) Lattice does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faster Algorithms for Constructing a Concept (Galois) Lattice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faster Algorithms for Constructing a Concept (Galois) Lattice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141530