Surprising Results of Trie-based FIM Algorithms

Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related techniques can be applied in FIM algorithms to improve efficiency. In this paper we propose new techniques for fast management, but more importantly we scrutinize the well-known ones especially those which can be employed in APRIORI. The theoretical claims are supported by results of a comprehensive set of experiments, based on hundreds of tests that were performed on numerous databases, with different support thresholds. We offer some surprising conclusions, which at some point contradict published claims.

• Type: Conference
• Year: 2004
• Where: FIMI
• Authors: Ferenc Bodon
• Keywords: Data Mining, FIM Algorithms, FIMI 2004, Frequent Itemset Mining, Many Trie-related Techniques