Computer Science ›› 2009, Vol. 36 ›› Issue (2): 175-178.
Previous Articles Next Articles
Online:
Published:
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
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2009/V36/I2/175
Cited