Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2007, Vol. 33 ›› Issue (03): 59-61. doi: 10.3969/j.issn.1000-3428.2007.03.022

• Software Technology and Database • Previous Articles     Next Articles

Algorithm for Updating Maximum Frequent Itemsets Based on BitMatrix

HU Bin1,2, JIANG Waiwen2, CAI Guomin1,2, HUANG Tianqiang1, ZHUO Yueming1   

  1. (1. Information Institute, Jishou University, Zhangjiajie 427000; 2. Information Institute, Central South University, Changsha 410083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-02-05 Published:2007-02-05

基于位阵的更新最大频繁项集算法

胡 斌1,2,蒋外文2,蔡国民1,2,黄天强1,卓月明1   

  1. (1. 吉首大学信息学院,张家界 427000;2. 中南大学信息学院,长沙 410083)

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和已挖掘的最大频繁项目集,对已挖掘的最大频繁项目集进行高效维护。

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