From concepts to concept lattice: a border algorithm for making covers explicit
he paper presents a new border algorithm for making the covering relation of concepts explicit for iceberg concept lattices. The border algorithm requires no information from the formal context relying only on the formal concept set in order to explicitly state the covering relation between formal concepts. Empirical testing is performed to compare the border algorithm with a traditional algorithm based on the Covering Edges algorithm from Concept Data Analysis.
This record is in the process of being updated. Please contact us for more information.