A parallel algorithm for lattice construction

  • Authors:

  • Jean François Djoufak Kengue;Petko Valtchev;Clémentin Tayou Djamegni

  • Affiliations:

  • Département d'informatique, Faculté de Sciences, Université de Yaoundé 1, Cameroun;DIRO, Université de Montréal, Canada;Laboratoire d'informatique, Faculté de Sciences, Université de Dschang, Cameroun

  • Venue:
  • ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The construction of the concept lattice of a context is a time consuming process. However, in many practical cases where FCA has proven to provide theoretical strength, e.g., in data mining, the volume of data to analyze is huge. This fact emphasizes the need for efficient lattice manipulations. The processing of large datasets has often been approached with parallel algorithms and some preliminary studies on parallel lattice construction exist in the literature. We propose here a novel divide-and-conquer (D&C) approach that operates by data slicing. In this paper, we present a new parallel algorithm, called DAC-ParaLaX, which borrows its main operating primitives from an existing sequential procedure and integrates them into a multi-process architecture. The algorithm has been implemented using a parallel dialect of the C ++ language and its practical performances have been compared to those of a homologue sequential algorithm.