A new FP-growth based on Hash and merging techniques
Lists
Only you see this
Abstract
In this paper,we improve frequent pattern growth(FP-Growth) algorithm,we replace the header table with Hash-header table.By merging the same frequency nodes in frequent pattern tree(FP-Tree),we compress the scale of the tree.The experimental results show that the proposed algorithm has improved the efficiency of query,and it can be applied in mining large data sets with association rules.
BibTeX
@inproceedings{he2018new,
author = {Qing He and Lu Liming},
title = {{A new FP-growth based on Hash and merging techniques}},
booktitle = {SHILAP},
year = {2018},
doi = {10.3969/j.issn.1000-5137.2018.04.012},
}Loading related content...