NextClosures: Parallel Computation of the Canonical Base with Background Knowledge

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

Abstract

The canonical base of a formal context plays a distinguished role in Formal Concept Analysis, as it is the only minimal implicational base known so far that can be described explicitly. Consequently, several algorithms for the computation of this base have been proposed. However, all those algorithms work sequentially by computing only one pseudo-intent at a time – a fact that heavily impairs the practicability 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 with respect to arbitrary implicational background knowledge. First experimental evaluations show that for sufficiently large data sets the speed-up is proportional to the number of available CPU cores.

Details

Original languageEnglish
Pages (from-to)490-510
Number of pages21
JournalInternational journal of general systems
Volume46
Issue number5
Publication statusPublished - 6 Aug 2017
Peer-reviewedYes

External IDs

Scopus 85026905577
ORCID /0000-0003-0219-0330/work/153109399

Keywords

Library keywords