loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1
Fast Online Dynamic Association Rule Mining
Kyoto, Japan
December 03-December 06
ISBN: 0-7695-1393-X
Yew-Kwong Woon, Nanyang Technological University
Wee-Keong Ng, Nanyang Technological University
Amitabha Das, Nanyang Technological University
At present, there are no association rule mining algorithms that are suitable for use in electronic commerce because they do not consider that new products are introduced and old ones are retired frequently and they assume that support thresholds do not change. In this paper, a new algorithm called "Fast Online Dynamic Association Rule Mining" (FOLDARM) is introduced for mining in electronic commerce. It uses a novel tree structure known as a "Support-Ordered Trie Itemset" (SOTrieIT) structure to hold pre-processed transactional data. It allows FOLDARM to generate large 1-itemsets and 2-itemsets quickly without scanning the database. In addition, the SOTrieIT structure can be easily and quickly updated when transactions are added or removed. It also stores data that is independent of the support threshold and thus can be used for mining with varying support thresholds without any degradation in performance. Experiments have shown that FOLDARM outperforms Apriori, a classic mining algorithm, by up to two orders of magnitude (100 times).
Index Terms:
Association rule mining, electronic commerce, incremental mining
Citation:
Yew-Kwong Woon, Wee-Keong Ng, Amitabha Das, "Fast Online Dynamic Association Rule Mining," wise, vol. 1, pp.0278, Second International Conference on Web Information Systems Engineering (WISE'01) Volume 1, 2001
Usage of this product signifies your acceptance of the Terms of Use.