An efficient way to find frequent pattern with dynamic programming approach

摘要

Data mining place viral aspect in many of the applications like market-basket analysis, fraud detection etc. In data mining association rule mining and frequent pattern mining, both are key feature of market-basket analysis. In a given large amount of transnational database where each record consists of items purchased by customer at store. One of the basic market basket analysis algorithm is an Apriori, which generate all candidates item-set frequent pattern. In this research paper we describe the improved candidate 1-itemsets generation and candidate 2-itemsets generation from traditional technique. This algorithm utilizes the dynamic programming approach to facilitate fast candidate itemset generation and searching. We have compared results with previous approach that optimize the database scans and eliminate duplicate candidate itemset generation. This technique helps research scholar.