Mining association rules, including implications, is an important topic in Knowledge Discovery research area and in Formal Concept Analysis (FCA). In this paper, we present a novel algorithm that computes in a parallel way the canonical direct unit basis of a formal context in FCA. To that end, the algorithm first performs a horizontal split of the initial context into subcontexts and then exploits the notion of minimal dual transversal to merge the canonical direct unit bases generated from subcontexts.
CITATION STYLE
Viaud, J. F., Bertet, K., Missaoui, R., & Demko, C. (2017). Distributed and parallel computation of the canonical direct basis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10308 LNAI, pp. 228–241). Springer Verlag. https://doi.org/10.1007/978-3-319-59271-8_15
Mendeley helps you to discover research relevant for your work.