期刊名称：International Journal of Computer Science Issues
印刷版ISSN：1694-0784
电子版ISSN：1694-0814
出版年度：2012
卷号：9
期号：3
出版社：IJCSI Press
摘要：In Data Mining the task of finding frequent pattern in large databases is very important and has been studied in large scale. Mining frequent patterns in transaction databases, time-series databases many other kinds of databases has been studied popularly in data mining research. This task is computationally expensive, especially when a large number of patterns exist and when there exists candidate set generation. In this study, we propose a novel frequent pattern tree (FP-Tree) structure using Huffman coding for storing compressed, crucial information about frequent patterns, develop an efficient FPTree based mining method. The FP-Tree Algorithm is an alternative way to find frequent item sets without using candidate generations, using a divide-and-conquer strategy.
