Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Mining Colossal Frequent Patterns

  • F. Zhu, X. Yan, J. Han, P. S. Yu, and H. Cheng, “Mining Colossal Frequent Patterns by Core Pattern Fusion”, ICDE'07.
  • We have many algorithms, but can we mine large (i.e., colossal) patterns? ― such as just size around 50 to 100? Unfortunately, not!
  • Why not? ― the curse of “downward closure” of frequent patterns
    • The “downward closure” property
      • Any sub-pattern of a frequent pattern is frequent.
    • Example. If (a1, a2, …, a100) is frequent, then a1, a2, …, a100, (a1, a2), (a1, a3), …, (a1, a100), (a1, a2, a3), … are all frequent! There are about 2100 such frequent itemsets!
    • No matter using breadth-first search (e.g., Apriori) or depth-first search (FPgrowth), we have to examine so many patterns
  • Thus the downward closure property leads to explosion!

Speaker notes:

Content Tools


There are currently no sources for this slide.