A Support-Ordered Trie for Fast Frequent Itemset Discovery
The importance of data mining is apparent with the advent of powerful data collection and storage tools; raw data is so abundant that manual analysis is no longer possible. Unfortunately, data mining problems are difficult to solve and this prompted the introduction of several novel data structures to improve mining efficiency. Here, we critically examine existing preprocessing data structures used in association rule mining for enhancing performance in an attempt to understand their strengths and weaknesses. Our analyses culminate in a practical structure called the SOTrielT (support-ordered trie itemset) and two synergistic algorithms to accompany it for the fast discovery of frequent itemsets. Experiments involving a wide range of synthetic data sets reveal that its algorithms outperform FP-growth, a recent association rule mining algorithm with excellent performance, by up to two orders of magnitude and, thus, verifying its' efficiency and viability.
Databases and Information Systems | Numerical Analysis and Scientific Computing
Data Management and Analytics
IEEE Transactions on Knowledge and Data Engineering
LIM, Ee Peng; Woon, Yew-Kwong; and NG, Wee-Keong.
A Support-Ordered Trie for Fast Frequent Itemset Discovery. (2004). IEEE Transactions on Knowledge and Data Engineering. 16, (7), 875-879. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/123