Incrementally fast updated sequential pattern trees
Incrementally fast updated sequential pattern trees
复制标题
增量快速更新的顺序模式树
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
Sheng
中科院分区：
文献类型：
--
作者：
Tzung;Hsin;Chun;Sheng
过去，为了有效地处理增量挖掘中的关联规则，提出了fufp树维护算法。在本文中，我们尝试基于预大序列的概念修改FUFP-tree维护算法来维护序列模式，以减少在增量挖掘中重新扫描原始数据库的需要。提出了一种快速更新的顺序模式树（FUSP树）结构和维护算法，使树的更新过程变得更加简单。它不需要重新扫描原始客户序列，直到新添加的客户序列的累计数量超过安全界限，这取决于数据库大小。因此，所提出的方法对于处理新增加的客户序列变得高效和有效。
In the past, the FUFP-tree maintenance algorithm is proposed to efficiently handle the association rules in incremental mining. In this paper, we attempt to modify the FUFP-tree maintenance algorithm for maintaining sequential patterns based on the concept of pre-large sequences to reduce the need for rescanning original databases in incremental mining. A fast updated sequential pattern trees (FUSP trees) structure and the maintenance algorithm are proposed, which makes the tree update process become easier. It does not require rescanning original customer sequences until the accumulative amount of newly added customer sequences exceed a safety bound, which depends on database size. The proposed approach thus becomes efficiently and effectively for handling newly added customer sequences.