DocumentCode
2424417
Title
Fast online dynamic association rule mining
Author
Woon, Yew-Kwong ; Ng, Wee-Keong ; Das, Amitabha
Author_Institution
Nanyang Technol. Univ., Singapore
Volume
1
fYear
2001
fDate
3-6 Dec. 2001
Firstpage
278
Abstract
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).
Keywords
data mining; electronic commerce; Fast Online Dynamic Association Rule Mining; association rule mining; electronic commerce; tree structure; Algorithm design and analysis; Association rules; Business; Data mining; Degradation; Electronic commerce; Itemsets; Logic; Transaction databases; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Web Information Systems Engineering, 2001. Proceedings of the Second International Conference on
Print_ISBN
0-7695-1393-X
Type
conf
DOI
10.1109/WISE.2001.996489
Filename
996489
Link To Document