Efficient Tree Based Structure for Mining Frequent Pattern from Transactional Databases

Many different types of data structure and algorithm have been proposed to extract frequent pattern from a large given database. One of the fastest frequent pattern mining algorithm is the CATS algorithm, Which can efficiently represent whole data structure over single scan of the database. We have proposed an efficient tree based structure and algorithm that provide the performance improvement over CATS algorithm in terms of execution time and memory usage.