A Parallel Algorithm Based on Dividing of Closure System for Structuring Concept Lattice

With the increasing of the context, the time complexity and the space complexity of structuring concept lattice will be dramatically increased accordingly. The new method of enhancing the structuring efficiency has been paid much attention because it is the premise for being used in a large and complicated data system. So far, there are mainly two structuring methods, collocation and overlay of context and folding search space partition of context. Based on the idea of closure division, this paper introduces a new parallel structuring algorithm termed Para Pruning algorithm. The algorithm can eliminate the redundancy and loss of information during the process of the dividing of the closure system. The experiment result showed the accuracy and validity of the present method by comparing with the Next Closure algorithm.