A Parallel Algorithm to Construct Concept Lattice

Concept lattice is an efficient tool for data analysis and knowledge discovery and has been used in many fields, such as data mining, machine learning, and information searching. With volumes of data growing increasingly, it´s important to design the algorithms which are more efficient. Therefore, a parallel algorithm of PSTCL (parallel sub-top concept lattice) is developed in this paper. The analysis and experiments show that the time performance of PSTCL has been improved significantly over Godin algorithms. In addition, the space performance is better than the algorithm used under the single computer environment.