快速挖掘全局最大频繁项目集-CiteSeerX.PDF

1000-9825/2005/16(04)0553 ©2005 Journal of Software 软 件 学 报 Vol.16, No.4 ∗ 快速挖掘全局最大频繁项目集 1+ 1 1 2 陆介平 , 杨 明 , 孙志挥 , 鞠时光 1(东南大学 计算机科学与工程系,江苏 南京 210096) 2(江苏大学 计算机科学与通信工程学院,江苏 镇江 212013) Fast Mining of Global Maximum Frequent Itemsets 1+ 1 1 2 LU Jie-Ping , YANG Ming , SUN Zhi-Hui , JU Shi-Guang 1(Department of Computer Science and Engineering, Southeast University, Nanjing 210096, China) 2(Department of Computer Science and Communication Engineering, Jiangsu University, Zhenjiang 212013, China) + Corresponding author: Phn: +86-511-4424674, Fax: +86-511-4424674, E-mail: zjjplu@, Received 2004-06-03; Accepted 2004-07-02 Lu JP, Yang M, Sun ZH, Ju SG. Fast mining of global maximum frequent itemsets. Journal of Software, 2005,16(4):553−560. DOI: 10.1360/jos160553 Abstract: Mining maximum frequent itemsets is a key problem in data mining field with numerous important applications. The existing algorithms of mining maximum frequent itemsets are based on local databases, and very little work has been done in distributed databases. However, using the existing algorithms for the maximum frequent itemsets or using the algorithms proposed for the global frequent itemsets needs to generate a lots of candidate itemsets and requires a large amount of communication overhead. Therefore, this paper proposes an algorithm for fast mining global maximum frequent itemsets (FMGMFI), which can conveniently get the global frequency of any itemset from the corresponding paths of every local FP-tree by using frequ