Article thumbnail

An improvement of FP-Growth association rule mining algorithm based on adjacency table

By Ming Yin, Wenjie Wang, Yang Liu and Dan Jiang

Abstract

FP-Growth algorithm is an association rule mining algorithm based on frequent pattern tree (FP-Tree), which doesn’t need to generate a large number of candidate sets. However, constructing FP-Tree requires two scansof the original transaction database and the recursive mining of FP-Tree to generate frequent itemsets. In addition, the algorithm can’t work effectively when the dataset is dense. To solve the problems of large memory usage and low time-effectiveness of data mining in this algorithm, this paper proposes an improved algorithm based on adjacency table using a hash table to store adjacency table, which considerably saves the finding time. The experimental results show that the improved algorithm has good performance especially for mining frequent itemsets in dense data sets

Publisher: EDP Sciences
DOI identifier: 10.1051/matecconf/201818910012
OAI identifier: oai:edpsciences.org:dkey/10.1051/matecconf/201818910012
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doi.org/10.1051/matecc... (external link)
  • https://www.matec-conferences.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.