The canonical base of a formal context plays a distinguished role in formal concept analysis. This is because it is the only minimal base so far that can be described explicitly. For the computation of this base several algorithms have been proposed. However, all those algorithms work sequentially, by computing only one pseudo-intent at a time - a fact which heavily impairs the practicability of using the canonical base in real-world applications. In this paper we shall introduce an approach that remedies this deficit by allowing the canonical base to be computed in a parallel manner. First experimental evaluations show that for sufficiently large data-sets the speedup is proportional to the number of available CPUs.
|Titel||Proceedings of the 12th International Conference on Concept Lattices and their Applications (CLA 2015), Clermont-Ferrand, France|
|Redakteure/-innen||Sadok Ben Yahia, Jan Konecny|
|Publikationsstatus||Veröffentlicht - 13 Okt. 2015|
|Reihe||CEUR Workshop Proceedings|