Work

Improved Fp-Growth Algorithm With Multiple Minimum Supports Using Maximum Constraints

Year: 2015
Type: article
Abstract: Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FPgrowth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.
Language: English
Open Access status: green
OpenAlex ID: W1840507838
FWCI: 1.207
Cites:
Cited by: 6
Related to: 9