期刊名称：International Journal of Hybrid Information Technology
印刷版ISSN：1738-9968
出版年度：2014
卷号：7
期号：3
页码：155-166
DOI：10.14257/ijhit.2014.7.3.16
出版社：SERSC
摘要：In this paper, we propose a new version of FP-Growth algorithm to find association rules. In this version, we vary the minsup value from one level to another. This variation is made in two cases: increasing and decreasing the minsup value. We performed a set of experiments to validate the usefulness of our proposition in the generation of association rules process.
