Parallel algorithm for computing fixpoints of Galois connections

This paper presents a parallel algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. The algorithm results as a parallelization of CbO (Kuznetsov 1999) in which we process disjoint sets of fixpoints simultaneously. One of the distinctive features of the algorithm compared to other parallel algorithms is that it avoids synchronization which has positive impacts on its speed and implementation. We describe the parallel algorithm, prove its correctness, and analyze its asymptotic complexity. Furthermore, we focus on implementation issues, scalability of the algorithm, and provide an evaluation of its efficiency on various data sets.

[1]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[2]  G. Grätzer.  General Lattice Theory , 1978 .

[3]  Anne Berry,et al.  A local approach to concept generation , 2007, Annals of Mathematics and Artificial Intelligence.

[4]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[5]  Claudio Carpineto,et al.  Concept data analysis - theory and applications , 2004 .

[6]  Engelbert Mephu Nguifo,et al.  A Parallel Algorithm to Generate Formal Concepts for Large Data , 2004, ICFCA.

[7]  Bernhard Ganter,et al.  Two Basic Algorithms in Concept Analysis , 2010, ICFCA.

[8]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[9]  Sergei O. Kuznetsov,et al.  Learning of Simple Conceptual Graphs from Positive and Negative Examples , 1999, PKDD.

[10]  Petko Valtchev,et al.  A Parallel Algorithm for Lattice Construction , 2005, ICFCA.

[11]  Fatma Baklouti,et al.  A distributed version of the Ganter algorithm for general Galois Lattices , 2005, CLA.

[12]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[13]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[14]  Vilém Vychodil,et al.  Discovery of optimal factors in binary data via a novel method of matrix decomposition , 2010, J. Comput. Syst. Sci..

[15]  Christian Lindig.  Fast Concept Analysis , 2000 .