摘要： Frequent pattern mining plays an essential role in many important data mining tasks. FP-growth is a very efficient algorithm for frequent pattern mining. However, it still suffers from creating conditional FP-tree separately and recursively during the min

关键词: 频繁模式 关联规则 数据库 Trans-树 数据挖掘 算法