Mining frequent patterns without candidate generation

By Jiawei Han, Jian Pei, Yiwen Yin. 2000

7,980 citations recorded by the source corpus.

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.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Charu C. Aggarwal
  2. Philip S. Yu
  3. Cynthia Rudin
  4. Jiawei Han
  5. Francisco Herrera
  6. Tong Wang
  7. George Karypis
  8. Mohammed J. Zaki

In Computational Theory and Mathematics

  1. Jiawei Han
  2. Cynthia Rudin
  3. George Karypis
  4. Mohammed J. Zaki
  5. Tong Wang
  6. Xifeng Yan
  7. Hong Cheng
  8. Jianyong Wang

In Information Systems

  1. Jiawei Han
  2. Cynthia Rudin
  3. Mohammed J. Zaki
  4. George Karypis
  5. Philip S. Yu
  6. Charu C. Aggarwal
  7. Xifeng Yan
  8. Michihiro Kuramochi

Citations in the corpus