Abstract:
The problem of incremental update of MFI is introduced, and corresponding algorithms, FAUMFI, is proposed. The algorithm makes full use of a built-up BitMatrix and MFI, thus it can maintain and update MFI efficiently. The execution of algorithms is illustrated.
Key words:
Maximum frequent itemset,
Data mining,
Incremental update
摘要: 讨论了最大频繁项集的增量式更新问题,提出最大频繁项目集更新算法FAUMFI,并举例说明了算法的执行过程。该算法充分利用已建立的BitMatrix和已挖掘的最大频繁项目集,对已挖掘的最大频繁项目集进行高效维护。
关键词:
最大频繁项集,
数据挖掘,
增量式更新
HU Bin; JIANG Waiwen; CAI Guomin; HUANG Tianqiang; ZHUO Yueming. Algorithm for Updating Maximum Frequent Itemsets Based on BitMatrix[J]. Computer Engineering, 2007, 33(03): 59-61.
胡 斌;蒋外文;蔡国民;黄天强;卓月明. 基于位阵的更新最大频繁项集算法[J]. 计算机工程, 2007, 33(03): 59-61.