Based on analyzing an association rule mining algorithm called FP tree. a new association rule mining algorithm called Enhanced FP was presented. As the main disadvantage of FP-Growth is that it is very difficult to implement because of its complex data structure. In this FP-tree takes a lot of time to build and also needs more memory for storing the transactions. To overcome these disadvantages, I introduce Enhanced-FP, which does its work without any prefix tree and any other complex data structure. It processes the transactions directly, so its main strength is its simplicity.
[1]
Gösta Grahne,et al.
Efficiently Using Prefix-trees in Mining Frequent Itemsets
,
2003,
FIMI.
[2]
Ramakrishnan Srikant,et al.
Fast algorithms for mining association rules
,
1998,
VLDB 1998.
[3]
Das Amrita,et al.
Mining Association Rules between Sets of Items in Large Databases
,
2013
.
[4]
Ferenc Bodon,et al.
A fast APRIORI implementation
,
2003,
FIMI.
[5]
Charu C. Aggarwal,et al.
A Tree Projection Algorithm for Generation of Frequent Item Sets
,
2001,
J. Parallel Distributed Comput..