Opening book details…
Can I read An Incremental Algorithm to Construct a Lattice of Set Intersections on EtoBox?
An Incremental Algorithm to Construct a Lattice of Set Intersections by Derrick G. Kourie; Sergei Obiedkov; Bruce W. Watson; Dean van der Merwe is a Computer Science article available to read on EtoBox.
What is An Incremental Algorithm to Construct a Lattice of Set Intersections about?
a b s t r a c t 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-byconstruction approach to algorithm development.
Who reads An Incremental Algorithm to Construct a Lattice of Set Intersections?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Derrick G. Kourie; Sergei Obiedkov; Bruce W. Watson; Dean van der Merwe
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0167-6423)
- Published
- 2009
- Language
- EN
- Field
- Computer Science (Physical Sciences)
More by Derrick G. Kourie; Sergei Obiedkov; Bruce W. Watson; Dean van der Merwe
Browse all works by Derrick G. Kourie; Sergei Obiedkov; Bruce W. Watson; Dean van der Merwe