fup

Research on an Association Rule Algorithm based on FUP

基于FUP算法的关联规则增量算法的研究

An improved incremental updating algorithm SFUP is developed based on study of the principle and efficiency of FUP algorithm .

通过对挖掘关联规则增量更新中FUP算法的关键思想以及性能进行了研究，提出了改进的FUP算法SFUP。

The article analyses the insight of FUP , refers to other correlative algorithms , and then brings forward a FUP-based algorithm that scans the original database little .

本文通过深入分析FUP算法的内在思想，借鉴其他相关算法的长处，提出了一个几乎无需扫描原数据库的FUPBased算法。

The relation between the suppport and the number of frequent itemsets is analyzed and a comparison between the algorithms FIU and FUP is made .

分析了支持率和频繁模式集合大小的关系，并对算法FIU和算法FUP进行了比较。

First , the article discusses the basic ideas of current FUP algorithm , then improves it on this basis , proposes an enhanced FUP algorithm EFUP , and presents the concrete process .

首先，该文讨论了现有的FUP算法的基本思想，然后在此基础上对其进行改进，提出了改进的FUP算法EFUP，给出了具体实现方法。

This paper has proposed fast update TD-FP-Tree algorithm ( PFU-TDFP ) with introducing FUP which is ne typical incremental mining algorithm based on Apriori to the TD-FP-Tree .

本文将基于Apriori的典型增量挖掘算法FUP思想引入TD-FP-Growth算法中TD-FP-Tree的快速更新，提出TD-FP-Tree快速更新算法（PFU-TDFP）。