%0 Conference Paper %1 han-2000 %A Han, Jiawei %A Pei, Jian %A Yin, Yiwen %B ACM International Conference on Management of Data and Symposium on Principles of Database Systems, SIGMOD/PODS 2000, Dallas, TX, USA, May 15-18, 2000 %C New York, NY, USA %D 2000 %I ACM %K %P 1-12 %R 10.1145/342009.335372 %T Mining frequent patterns without candidate generation %X Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. In this study, we propose a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develop an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth. Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a highly condensed, much smaller data structure, which avoids costly, repeated database scans, (2) our FP-tree-based mining adopts a pattern fragment growth method to avoid the costly generation of a large number of candidate sets, and (3) a partitioning-based, divide-and-conquer method is used to decompose the mining task into a set of smaller tasks for mining confined patterns in conditional databases, which dramatically reduces the search space. Our performance study shows that the FP-growth method is efficient and scalable for mining both long and short frequent patterns, and is about an order of magnitude faster than the Apriori algorithm and also faster than some recently reported new frequent pattern mining methods.

@inproceedings{han-2000, abstract = {Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. In this study, we propose a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develop an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth. Efficiency of mining is achieved with three techniques: (1) a large database is compressed into a highly condensed, much smaller data structure, which avoids costly, repeated database scans, (2) our FP-tree-based mining adopts a pattern fragment growth method to avoid the costly generation of a large number of candidate sets, and (3) a partitioning-based, divide-and-conquer method is used to decompose the mining task into a set of smaller tasks for mining confined patterns in conditional databases, which dramatically reduces the search space. Our performance study shows that the FP-growth method is efficient and scalable for mining both long and short frequent patterns, and is about an order of magnitude faster than the Apriori algorithm and also faster than some recently reported new frequent pattern mining methods.}, added-at = {2012-01-05T10:37:24.000+0100}, address = {New York, NY, USA}, author = {Han, Jiawei and Pei, Jian and Yin, Yiwen}, biburl = {https://www.bibsonomy.org/bibtex/247a99ff83dccdef64180636c2e50e412/juergen.mueller}, booktitle = {ACM International Conference on Management of Data and Symposium on Principles of Database Systems, SIGMOD/PODS 2000, Dallas, TX, USA, May 15-18, 2000}, doi = {10.1145/342009.335372}, interhash = {e4fe828e65efd092193dcf9195df8074}, intrahash = {47a99ff83dccdef64180636c2e50e412}, keywords = {}, pages = {1-12}, publisher = {ACM}, timestamp = {2012-01-05T10:37:24.000+0100}, title = {Mining frequent patterns without candidate generation}, year = 2000 }