New Generation Computing

, Volume 23, Issue 4, pp 315–337

Mining frequent patterns with the pattern tree

  • Hao Huang
  • Xindong Wu
  • Richard Relue
Regular Papers

DOI: 10.1007/BF03037636

Cite this article as:
Huang, H., Wu, X. & Relue, R. New Gener Comput (2005) 23: 315. doi:10.1007/BF03037636


Mining frequent patterns with a frequent pattern tree (FP-tree in short) avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves much better performance and efficiency than Apriori-like algorithms. However, the database still needs to be scanned twice to get the FP-tree. This can be very time-consuming when new data is added to an existing database because two scans may be needed for not only the new data but also the existing data. In this research we propose a new data structure, the pattern tree (P-tree in short), and a new technique, which can get the P-tree through only one scan of the database and can obtain the corresponding FP-tree with a specified support threshold. Updating a P-tree with new data needs one scan of the new data only, and the existing data does not need to be re-scanned. Our experiments show that the P-tree method outperforms the FP-tree method by a factor up to an order of magnitude in large datasets.


Data MiningAssociation RulesFrequent Patterns

Copyright information

© Ohmsha, Ltd. and Springer 2005

Authors and Affiliations

  • Hao Huang
    • 1
  • Xindong Wu
    • 2
  • Richard Relue
    • 3
  1. 1.Department of Computer ScienceUniversity of VirginiaCharlottesvilleUSA
  2. 2.Department of Computer ScienceUniversity of VermontBurlingtonUSA
  3. 3.Department of Mathematical and Computer SciencesColorado School of MinesGoldenUSA