【摘要】 提出了一种利用FP树表示增量数据库,然后进行增量挖掘的方法,即IA_FP-Growth算法.算法重构和合并两个小的时间上连续的FP树,以获得由FP-Growth算法生成的FP树.与其他从数据库读取事务的顺序增量算法不同,IA_FP-Growth算法使用原FP-tree作为预处理数据库来获取项目集,因此其花费较少的时间来构建新的增量FP-tree项目.实验结果表明,随着数据库大小的增加,IA_FP-Growth的运行时间的增加要少得多,而且与其他算法比较也是最少的.更多还原

【Abstract】 This paper proposes a batch incremental processing algorithm IA_FP-Growth that restructures and merges two small consecutive duration FP-trees to obtain a FP-tree of the FP-Growth algorithm. Unlike other sequential incremental algorithms that read transactions from the database, IA_FP-Growth uses the FP-tree as a preprocessing database to get item-sets, and the IA_FP-Growth algorithm takes less time for constructing FP-tree. Experimental results show that, as the size of the database increases, increase in runtime of IA_FP-Growth is much less and is least of all the other algorithms.更多还原