An Improved FP Algorithm for Association Rule Mining

Association rules among the large number of item sets is considered as an important aspect of data mining. Researchers developed a lot of algorithms and techniques for determining association rules. The main problem is the generation of candidate set. Among the existing techniques, the frequent pattern growth (FP-growth) method is the most efficient and scalable approach. It mines the frequent item set without candidate set generation. The main obstacle of FP growth is, it generates a massive number of conditional FP tree. In this research paper, we proposed a new and improved FP tree with a table and a new algorithm for mining association rules. This algorithm mines all possible frequent item set and also avoid the time consuming operation of searching whole tree and also improve time in add or delete transactions.It also provides the frequency of frequent items, which is used to estimate the desired association rules.