[1]杨明,孙志挥,吉根林.一种基于分布式数据库的全局频繁项目集更新算法[J].东南大学学报(自然科学版),2002,32(6):879-883.[doi:10.3969/j.issn.1001-0505.2002.06.012]
　Yang Ming,Sun Zhihui,Ji Genlin.Algorithm based on distributed database for updating global frequent itemsets[J].Journal of Southeast University (Natural Science Edition),2002,32(6):879-883.[doi:10.3969/j.issn.1001-0505.2002.06.012]
点击复制

一种基于分布式数据库的全局频繁项目集更新算法()
分享到：

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
32
期数:
2002年第6期
页码:
879-883
栏目:
计算机科学与工程
出版日期:
2002-11-20

文章信息/Info

Title:
Algorithm based on distributed database for updating global frequent itemsets
作者:
杨明1; 2;  孙志挥1;  吉根林1
1 东南大学计算机科学与工程系,南京 210096; 2 安徽机电学院计算机科学与工程系,芜湖 241000
Author(s):
Yang Ming1; 2;  Sun Zhihui1;  Ji Genlin1
1 Department of Computer Science and Engineering, Southeast University, Nanjing 210096,China
2 Department of Computer Science and Engineering, Anhui Institute of Mechanical and Electrical Engineering,Wuhu 241000,China
关键词:
数据挖掘;  分布式数据库;  全局频繁项目集;  频繁模式树;  更新
Keywords:
data mining;  distributed database;  global frequent itemsets;  frequent pattern tree(FP-tree);  updating
分类号:
TP311
DOI:
10.3969/j.issn.1001-0505.2002.06.012
摘要:
在算法FMAGF的基础上,提出了一种基于分布式数据库的全局频繁项目集更新算法——UAGFI,该算法主要考虑最小支持度发生变化时全局频繁项目集的更新情况. UAGFI在最坏的情况下仅须扫描各局部数据库一遍,并利用已挖掘的结果,可避免传送某些原全局频繁项目对应的条件频繁模式树,从而降低网络通讯代价.实验结果表明,UAGFI算法是有效可行的.
Abstract:
A new algorithm UAGFI(updating algorithm of global frequent itemsets based on distributed database)is introduced, it considers the updating of global frequent itemsets when dynamically adjusting minimum support measure threshold. In the worst case, UAGFI only scans every local transaction database once and can avoid transmitting some conditional pattern tree and/or base of original global frequent item by utilizing mined results. Therefore, UAGFI uses far less communication overhead and obviously improves updating efficiency of global frequent itemsets. Experimental results show that UAGFI algorithm is efficient and effective.

参考文献/References:

[1] 王能斌.数据库系统原理[M].北京:电子工业出版社,2000.
[2] Agrawal R,Imielinski T,Swami A.Mining association rules between sets of items in large databases[A].In:Proceedings of the ACM SIGMOD International Conference on Management of Data[C].Washington,USA,1993.207-216.
[3] Agrawal R,Srikant R.Fast algorithms for mining association rules[A].In:Proceedings of the 20th International Conference Very Large Data Bases(VLDB’94)[C].Santiago,Chile,1994.487-499.
[4] Han J,Pei J,Yin Y. Mining partial periodicity using frequent pattern tree[R].Simon Fraser University,Canada:Com-
　 puting Science Technical Report:TR-99-10,1999.
[5] Mrikant R,Agrawal R.Mining quantitative association rules from large databases[A].In: Proceedings of ACM SIGMOD International Conference on Management of Data[C].Montreal,Canada,1996.1-12.
[6] Han J W,Pei J,Yin Y.Mining frequent patterns without candidate generation[A].In:Proceedings of the ACM SIGMOD International Conference on Management of Data[C].Dallas,USA,2000.1-12.
[7] Cheung D,Han J,Ng V,et al.Maintenance of discovered association rules in large databases:an incremental updating technique[A].In:Proceedings of the 12th International Conference on Data Engineering[C].New Orleans,Louisiana,USA,1996.106-114.
[8] 冯玉才,冯剑琳.关联规则的增量式更新算法[J].软件学报,1998,9(4):301-306.
　 Feng Yucai,Feng Jianlin.Incremental updating algorithms for mining association rules[J].Journal of Software,1998,9(4):301-306.(in Chinese)
[9] 杨明,孙志挥.一种基于前缀广义表的关联规则增量式更新算法[J].计算机学报,2003.(待发表)
　 Yang Ming,Sun Zhihui.An incremental updating algorithm based on prefix general list for association rules[J].Chinese Journal of Computers,2003.(to appear)(in Chinese)
[10] 杨明,孙志挥,赵传申.交易数据库的加权关联规则增量更新算法[J].计算机工程与应用,2002,38(1):71-73.
　　Yang Ming,Sun Zhihui,Zhao Chuanshen.The incremental updating algorithm of weighted association rules based on transaction database[J]. Computer Engineering and Applications,2002,38(1):71-73.(in Chinese)
[11] Park J S,Chen M S,Yu P S.Efficient parallel data mining for association rules[A].In: Proc of the 4th International Conference on Information and Knowledge Management[C].Baltimore,Maryland,1995.31-36.
[12] Agrawal R,Shafer J.Parallel mining of association rules[J]. IEEE Transactions on Knowledge and Data Engineering,1996,8(6):962-969.
[13] Cheang D W,Han J W,Ng V T,et al.A fast distributed algorithm for mining association rules[A].In: Proceedings of IEEE 4th International Conference Parallel and Distributed Information Systems[C].Miami Beach,Florida,1996.31-44.
[14] Schuster A,Wolff R.Communication efficient distributed mining of association rules[A].In: Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data[C].Santa Barbara,California,2001.473-484.
[15] 杨明,孙志挥,吉根林.快速挖掘全局频繁项目集[J].计算机研究与发展,2003.(待发表)
　　Yang Ming,Sun Zhihui,Ji Genlin.Fast mining of global frequent itemsets[J]. Computer Research and Development,2003.(to appear)(in Chinese)

相似文献/References:

[1]赵传申,孙志挥.半结构化文档数据流的快速频繁模式挖掘[J].东南大学学报(自然科学版),2006,36(3):452.[doi:10.3969/j.issn.1001-0505.2006.03.025]
　Zhao Chuanshen,Sun Zhihui.Fast mining frequent patterns in semi-structured data stream[J].Journal of Southeast University (Natural Science Edition),2006,36(6):452.[doi:10.3969/j.issn.1001-0505.2006.03.025]
[2]陆建江,徐宝文,邹晓峰,等.模糊关联规则的并行挖掘算法[J].东南大学学报(自然科学版),2005,35(2):165.[doi:10.3969/j.issn.1001-0505.2005.02.001]
　Lu Jianjiang,Xu Baowen,Zou Xiaofeng,et al.Parallel mining algorithm for fuzzy association rules[J].Journal of Southeast University (Natural Science Edition),2005,35(6):165.[doi:10.3969/j.issn.1001-0505.2005.02.001]
[3]丁艺明,金远平.一种基于记录分区的多值关联规则挖掘算法[J].东南大学学报(自然科学版),2000,30(2):6.[doi:10.3969/j.issn.1001-0505.2000.02.002]
　Ding Yiming,Jin Yuanping.A Record Partition Based Algorithm for Mining Quantitative Association Rules[J].Journal of Southeast University (Natural Science Edition),2000,30(6):6.[doi:10.3969/j.issn.1001-0505.2000.02.002]
[4]朱慧云,陈森发,张丽杰.动态环境下多个时期的客户购物模式变化挖掘[J].东南大学学报(自然科学版),2012,42(5):1012.[doi:10.3969/j.issn.1001-0505.2012.05.038]
　Zhu Huiyun,Chen Senfa,Zhang Lijie.Change mining of customer shopping patterns from multi-period datasets under dynamic environment[J].Journal of Southeast University (Natural Science Edition),2012,42(6):1012.[doi:10.3969/j.issn.1001-0505.2012.05.038]
[5]陆介平,刘月波,倪巍伟,等.基于PrefixSpan的快速交互序列模式挖掘算法[J].东南大学学报(自然科学版),2005,35(5):692.[doi:10.3969/j.issn.1001-0505.2005.05.008]
　Lu Jieping,Liu Yuebo,Ni Weiwei,et al.Fast interactive sequential pattern mining algorithm based on PrefixSpan[J].Journal of Southeast University (Natural Science Edition),2005,35(6):692.[doi:10.3969/j.issn.1001-0505.2005.05.008]
[6]张净,孙志挥.GDLOF:基于网格和稠密单元的快速局部离群点探测算法[J].东南大学学报(自然科学版),2005,35(6):863.[doi:10.3969/j.issn.1001-0505.2005.06.007]
　Zhang Jing,Sun Zhihui.GDLOF: fast local outlier detection algorithm with grid-based and dense cell[J].Journal of Southeast University (Natural Science Edition),2005,35(6):863.[doi:10.3969/j.issn.1001-0505.2005.06.007]
[7]陈岭,陈元中,陈根才.基于操作序列挖掘的OLAP查询推荐方法[J].东南大学学报(自然科学版),2011,41(3):498.[doi:10.3969/j.issn.1001-0505.2011.03.013]
　Chen Ling,Chen Yuanzhong,Chen Gencai.Operation sequence mining based OLAP query recommendation method[J].Journal of Southeast University (Natural Science Edition),2011,41(6):498.[doi:10.3969/j.issn.1001-0505.2011.03.013]
[8]胡孔法,唐小丽,达庆利,等.一种高效挖掘高维数据的频繁闭合模式算法[J].东南大学学报(自然科学版),2007,37(4):569.[doi:10.3969/j.issn.1001-0505.2007.04.005]
　Hu Kongfa,Tang Xiaoli,Da Qingli,et al.Efficient algorithm for frequent closed patterns mining from high dimensional data[J].Journal of Southeast University (Natural Science Edition),2007,37(6):569.[doi:10.3969/j.issn.1001-0505.2007.04.005]
[9]龚振志,胡孔法,达庆利,等.DMGSP:一种快速分布式全局序列模式挖掘算法[J].东南大学学报(自然科学版),2007,37(4):574.[doi:10.3969/j.issn.1001-0505.2007.04.006]
　Gong Zhenzhi,Hu Kongfa,Da Qingli,et al.DMGSP: an algorithm of distributed mining global sequential pattern on distributed system[J].Journal of Southeast University (Natural Science Edition),2007,37(6):574.[doi:10.3969/j.issn.1001-0505.2007.04.006]
[10]肖利,金远平,徐宏炳,等.一个新的挖掘广义关联规则算法[J].东南大学学报(自然科学版),1997,27(6):76.[doi:10.3969/j.issn.1001-0505.1997.06.015]
　Xiao Li,Jin Yuanping,Xu Hongbing,et al.A New Algorithm for Mining Generalized Association Rules[J].Journal of Southeast University (Natural Science Edition),1997,27(6):76.[doi:10.3969/j.issn.1001-0505.1997.06.015]

备注/Memo

备注/Memo:
基金项目: 国家自然科学基金资助项目(79970092)、安徽省自然科学基金资助项目(03042205).
作者简介: 杨明(1964—),男,博士生,副教授; 孙志挥(联系人),男,教授,博士生导师,sunkitty@jlanline.com.
更新日期/Last Update: 2002-11-20