Login / Signup

An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms.

Ping GuoYang ZhouJun ZhuangTing ChenYan-Rong Kang
Published in: ADMA (2005)
Keyphrases
  • maximal frequent
  • k means
  • frequent item sets
  • np hard
  • preprocessing
  • tree structure
  • maximal frequent itemsets
  • data analysis
  • distance function
  • frequent patterns
  • mining algorithm
  • frequent sequences