Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.scico.2008.09.015 | Sci. Comput. Program. |
Keywords | Field | DocType |
related concept lattice construction,incremental algorithm,previous study,correctness by construction,closure system,set intersection,empirical efficiency,concept lattice,correctness-by-construction approach | Intersection (set theory),Ramer–Douglas–Peucker algorithm,Lattice (order),Computer science,Algorithm,Lattice reduction | Journal |
Volume | Issue | ISSN |
74 | 3 | Science of Computer Programming |
Citations | PageRank | References |
23 | 0.78 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Derrick G. Kourie | 1 | 223 | 33.10 |
| Sergei Obiedkov | 2 | 148 | 7.66 |
| Bruce W. Watson | 3 | 338 | 53.24 |
| Dean van der Merwe | 4 | 88 | 3.85 |