An incremental algorithm to construct a lattice of set intersections

32Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

An incremental algorithm to construct a lattice from a collection of sets is derived, refined, analyzed, and related to a similar previously published algorithm for constructing concept lattices. The lattice constructed by the algorithm is the one obtained by closing the collection of sets with respect to set intersection. The analysis explains the empirical efficiency of the related concept lattice construction algorithm that had been observed in previous studies. The derivation highlights the effectiveness of a correctness-by-construction approach to algorithm development. © 2008 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Kourie, D. G., Obiedkov, S., Watson, B. W., & van der Merwe, D. (2009). An incremental algorithm to construct a lattice of set intersections. Science of Computer Programming, 74(3), 128–142. https://doi.org/10.1016/j.scico.2008.09.015

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free