GC-Tree: A Fast Online Algorithm for Mining Frequent Closed Itemsets (2008)
Abstract. Frequent closed itemsets is a complete and condensed representaion for all the frequent itemsets, and it’s important to generate non-redundant association rules. It has been studied...
Finding Frequent Closed Itemsets in Sliding Window in Linear Time (2008)
CHEN, Junbo, ZHOU, Bo, CHEN, Lu, WANG, Xinyu, DING, Yiqun
One of the most well-studied problems in data mining is computing the collection of frequent itemsets in large transactional databases. Since the introduction of the famous Apriori algorithm [14],...
Thesis (Ph. D.)--Louisiana State University, Baton Rouge, 1995.