DATA MINING OF FREQUENT PATTERNS USING FP TREE

ABSTRACT

The aim of project is to build a frequent pattern tree for mining of the
frequent pattern in different databases. There are many approaches that
have been proposed for mining frequent pattern. However, either the
search space or memory space is huge, such that the performance for the
previous approach degrades when the database is massive or the
threshold for mining frequent patterns is low. In this project , we
propose an algorithm for mining frequent patterns. Our algorithm only
needs to construct a FP-tree and traverse each subtree of the FP-tree to
generate all the frequent patterns for an item without constructing any
other subtrees. After traversing a subtree for an item, our approach
merges and removes the subtree to reduce the FP-tree smaller and
smaller. By this way, only a subtree of the reduced FP-tree needs to be
traversed to generate frequent patterns for the other item. Since there is
no extra trees constructed and the frequent patterns generated for an item
only need to traverse a subtree, our approach is much more efficient than
FP-Growth algorithm. This helps in mining of the data more efficiently
and takes less time.

GROUP MEMBERS:
Vishnu Nagpal(16BCE1199)