【摘要】 针对关联规则负增量更新的挖掘问题,提出了一种高效的关联规则负增量更新算法,即NIUA。该算法充分利用原数据库中已有的频繁项集、所有1-项集来生成最小非频繁项集;并采用选样等策略求出删减数据后的频繁项集。整个算法只需扫描删减后的事务数据库一遍,从而提高了关联规则的更新效率。更多还原

【Abstract】 The paper presents a High-efficient Negative Incremental Updating Algorithm,focusing on the Negative Incremental Updating for mining association rules(NIUA).The algorithm can get Minimal Infrequent Item Set by making full use of existing frequent item sets from the original Database and all 1-item sets to and the frequent item set for reduced Database by sampling.Only one time scanning of the original Database is needed,thus improving the updating efficiency.更多还原