点击次数：

论文类型：会议论文

发表时间：2007-08-24

收录刊物：EI、CPCI-S、Scopus

卷号：2

页面范围：678-+

摘要：Intertransaction frequent itemsets break the barriers of transactions, and extend the traditional single-dimensional intratransaction association rules to multidimensional intertransaction association rules. However the amount of intertransaction frequent itemsets becomes very large with the increase of the sliding window. Frequent closed itemsets can uniquely determine the set of all frequent itemsets and their exact frequency while they are far smaller than all frequent itemsets. In this paper, we introduce the notion of intertransaction frequent closed itemset, analyze its properties, and develop an efficient algorithm, IFCIA (Intertransaction Frequent Closed Itemsets Algorithm). The algorithm adopts division-based method and condition database to avoid generating large extended database, and uses bitmap structure and extended bitwise operations to generate candidate itemsets and count the support quickly. Experiments on real and synthetic databases show that IFCIA is an effective algorithm for mining intertransaction frequent closed itemsets.