2014
DOI: 10.14257/ijhit.2014.7.3.16
|View full text |Cite
|
Sign up to set email alerts
|

MS-FP-Growth: A Multi-support Version of FP-Growth Algorithm

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…Taktak and Slimani [2] have proposed a multi-support variation in the versions of FP Growth by handling two cases of increasing and decreasing the minsup values. They have generated rare rules carrying out their work [2].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Taktak and Slimani [2] have proposed a multi-support variation in the versions of FP Growth by handling two cases of increasing and decreasing the minsup values. They have generated rare rules carrying out their work [2].…”
Section: Related Workmentioning
confidence: 99%
“…Taktak and Slimani [2] have proposed a multi-support variation in the versions of FP Growth by handling two cases of increasing and decreasing the minsup values. They have generated rare rules carrying out their work [2]. Hipp et al [3] have described the fundamentals of the association rule mining by deriving a general framework for the same.…”
Section: Related Workmentioning
confidence: 99%