A Distributed Algorithm for Formal Concepts Processing based on Search Subspaces

The processing of dense contexts is a common problem in Formal Concept Analysis. From input contexts, all possible combinations must be evaluated in order to obtain all correlations between objects and attributes. The state-of-the-art shows that this problem can be solved through distributed processing. Partial concepts would be obtained from a distributed environment composed of machine clusters in order to achieve the final set of concepts. Therefore, the goal of this paper is to propose, develop, and evaluate a distributed algorithm with high performance to solve the problem of dense contexts. The speedup achieved through the distributed algorithm shows an improvement of performance, but mainly, a high-balance workload which reduces the processing time considerably. For this reason, the main contribution of this paper is the distributed algorithm, capable of accelerating the processing for dense formal contexts.

[1]  Dayou Liu,et al.  A parallel algorithm based on search space partition for generating concepts , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

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

[3]  Engelbert Mephu Nguifo,et al.  Partitioning large data to scale up lattice-based algorithm , 2003, Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence.

[4]  Luis E. Zárate,et al.  Handling Large Formal Context Using BDD - Perspectives and Limitations , 2009, ICFCA.

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

[6]  Qiang Wu,et al.  Theoretical research on the distributed construction of concept lattices , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[7]  Xiang Wei,et al.  A Parallel Algorithm to Construct Concept Lattice , 2007, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007).