The concept lattice is an effective tool for data analysis and rule extraction, it is often well to mine frequent patterns by making use of concept lattice. In this paper, a frequent itemset mining algorithm FPCL based on concept lattice which builds lattice in batches, the algorithm builds lattice down layer by layer through the layer concept nodes and temporary nodes based on hierarchical concept lattice; and seeks up the parent-child relationship upward concept nodes layer by layer, which can be generated the Hasse diagram with the inter-layer connection. In addition, in the process of the generation of each lattice node, we do the dynamic pruning for the concept lattice based on the minimum support degree and relevant properties, and delete a large number of non-frequent, repeat and containing nodes, such that redundant lattice nodes do not generate, thus the space and time complexities of the algorithm are greatly enhanced. The experimental results show that the algorithm has a good performance
