Abstract: A fast algorithm Q-CFIsL for mining closed frequent itemsets and building their lattice was presented. It introduced prec（X）,which can make the subsumption cheching and latiice building more efficiently. Experimental results show that Q-CFIsL outperforms

Key words: Association rule, Closed frequent itemset, Closed frequent itemset lattice