Faster Algorithms for Constructing a Concept (Galois) Lattice

Simple item page
dc.creatorChoi, Vicky
dc.date2006-02-19
dc.date2006-06-01
dc.date.accessioned2026-07-07T07:02:33Z
dc.date.available2026-07-07T07:02:33Z
dc.descriptionIn 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.
dc.description15 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/cs/0602069
dc.identifierhttp://arxiv.org/abs/cs/0602069
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/108638
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.titleFaster Algorithms for Constructing a Concept (Galois) Lattice
dc.typetext

Files

Collections

arXiv