Abstract: This paper presents an pattern decomposition algorithm based on FP-Tree. It focuses on FP-Tree, which is compact, not originaldataset, and improves PD algorithm’s mining efficiency. An example is presented to illustrate this algorithm’s mining process.

摘要： 提出了基于FP-Tree的PD算法。该算法将模式分解焦点从原始数据集转移到数据相对集中的FP-Tree上,从而进一步提高了PD算法挖掘频繁模式集的效率。文中以实例说明了该算法的工作过程。

关键词: 数据挖掘, 频繁模式树, 模式分解算法

CLC Number: 

• TP311.13