Abstract: Aiming at the maintenance problems of maximum frequent itemsets based on support change and interconversion between frequent itemsets and maximum frequent itemsets, this paper proposes three relevant algorithms. It adjusts the support rating constantly during the process of mining maximum frequent itemsets to realize fast update of maximum frequent itemsets. Based on support counting of the subsets of maximum frequent itemsets, existing maximum frequent itemsets are transformed into frequent itemsets.

Key words: maximum frequent itemsets, data mining, update, frequent pattern tree

摘要： 针对基于支持度变化的最大频繁项集维护问题、频繁项集与最大频繁项集互转换时的维护问题，提出3种相应算法。在挖掘最大频繁项集的过程中不断调节支持度大小，以实现其快速更新。基于最大频繁项集子集的支持计数，将现有最大频繁项集转换为频繁项集。

关键词: 最大频繁项集, 数据挖掘, 更新, 频繁模式树

CLC Number: 

• TP391