Breaking the barrier of transactions : mining inter-transaction association rules
|Authors||Tung, Anthony K. H.
|Source||Proceedings : KDD ... / International Conference on Knowledge Discovery & Data Mining, San Diego, CA, USA, ACM, New York, USA,, 15-18 Aug. 1999, p. 297-301|
|Summary||Most of the previous studies on mining association rules are on mining intra-transaction associations, i.e., the associations among items within the same transaction, where the notion of the transaction could be the items bought by the same customer, the events happened on the same day, etc. In this study, we break the barrier of transactions and extend the scope of mining association rules from traditional intra-transaction associations to inter-transaction associations. Mining inter-transaction associations poses more challenges on efficient processing than mining intra-transaction associations because the number of potential association rules becomes extremely large after the boundary of transactions is broken. In this study, we introduce the notion of inter-transaction association rule, define its measurements: support and confidence, and develop an efficient algorithm, FITI (an acronym for "First Intra Then Inter"), for mining inter-transaction associations. We compare FITI with EH-Apriori, the best algorithm in our previous proposal, and demonstrate a substantial performance gain of FITI over EH-Apriori.|
|Rights||© ACM, 1999. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Proceedings : KDD ... / International Conference on Knowledge Discovery & Data Mining, San Diego, CA, USA, 15-18 Aug. 1999, ACM, New York, USA, 1999, p. 297-301|
View full-text via DOI
Files in this item: