COMPRESSED FREQUENT PATTERN TREE

The use of Data mining is increasing very rapidly as daily analysis of transaction database consisting of data is increasing. In that data, there ae various item which occur frequently in same pattern. In data mining there are large number of algorithm whi ch are available and used for finding the frequent pattern. In the existing system the algorithm used are Apriori and FP - Growth. The result obtained from such algorithm are very time consuming and not efficient. In proposed system we are using more compact data structure named Compressed FP Tre. We proposed a new algorithm CT - PRO which uses the Compressed FP Tree. The result of the proposed algorithm is much more efficient in terms of performance.