期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

P2P网络中最大频繁项集挖掘算法研究 被引量：1

Research on maximal frequent itemset mining algorithm over P2P network
在线阅读 下载PDF
导出
摘要 为解决P2P网络频繁项集挖掘中存在的全体频繁项集数量过多和网络通信开销较大这两个问题,提出了一种在P2P网络中挖掘最大频繁项集的算法P2PMaxSet。首先,该算法只挖掘最大频繁项集,减少了结果的数量;其次,每个节点只需与邻居节点进行结果交互,节省了大量的通信开销;最后,讨论了网络动态变化时算法的调整策略。实验结果表明,算法P2PMaxSet具有较高的准确率和较少的通信开销。 The obstacles mainly lie in numerous frequent itemsets and huge communication cost. To solve the two problems, this paper proposed a maximal itemset mining algorithm P2PMaxSet. Firstly,only considered maximal itemset,which reduced the number of itemsets greatly. Secondly,only interchanged mining results between neighbor nodes,which saved communication cost. Finally,discussed adjust strategies for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.
作者 邓忠军 宋威 郑雪峰 王少杰
机构地区 北京科技大学信息工程学院 北方工业大学信息工程学院 国家信息技术安全研究中心
出处 《计算机应用研究》 CSCD 北大核心 2010年第9期3490-3492,共3页 Application Research of Computers
基金 国家“863”计划资助项目(2007AA012474) 北京市优秀人才培养资助项目(2009D005002000009)
关键词 数据挖掘 P2P网络 最大频繁项集 关联规则 data mining P2P network maximal frequent itemset association rule
分类号 TP311 [自动化与计算机技术—计算机软件与理论]
  • 相关文献

参考文献8

  • 1程舒通,徐从富.关联规则挖掘技术研究进展[J].计算机应用研究,2009,26(9):3210-3213. 被引量：14
  • 2TAYLOR I J.From P2P to Web services and grids[M].London:Springer-Verlag,2005.
  • 3KANTERE V,TSOUMAKOS D,SELLIS T K,et al.GrouPeer:dynamic clustering of P2P databases[J].Information Systems,2009,34(1):62-86.
  • 4DATTA S,GIANNELLA C R,KARGUPT A,et al.Approximate distributed K-means clustering over a peer-to-peer network[J].IEEE Trans on Knowledge and Data Engineering,2009,21(10):1372-1388.
  • 5WOLFF R,SCHUSTER A.Association rule mining in peer-to-peer systems[J].IEEE Trans on Systems,Man,and Cybernetics,Part B,2004,34(6):2426-2438.
  • 6BOUTSINAS B,SIOTOS C,GEROLIMATOS A.distributed mining of association rules based on reducing the support threshold[J].International Journal on Artificial Intelligence Tools,2008,17(6):1109-1129.
  • 7YI Xun,ZHANG Yan-chun.Privacy-preserving distributed association rule mining via semi-trusted mixer[J].Data & Knowledge Engineering,2007,63(2):550-567.
  • 8SONG Wei,YANG Bing-ru,XU Zhang-yan.Index-MaxMiner:a new maximal frequent itemset mining algorithm[J].International Journal on Artificial Intelligence Tools,2008,17(2):303-320.

二级参考文献24

  • 1王俊峰,杨建华,周虹霞,谢高岗,周明天.网络测量中自适应数据采集方法(英文)[J].软件学报,2004,15(8):1227-1236. 被引量：11
  • 2AGRAWAL R, IMIELINSKI T, SWAMI A. Mining association rules between sets of items in large databases[ C]//Proc of ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1993 : 207-216.
  • 3AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules[C]//Proc of the 20th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann Publishers, 1994: 478-499.
  • 4PARK J S, CHEN M S, YU P S. Using a hash based method with transaction trimming for mining association rules [ J ]. IEEE Trans on Knowledge and Data Engineering, 1997, 9(5) :813-825.
  • 5BRIN S, MOTWANI R, ULLMAN J D, et al. Dynamic itemset counting and implication rules for market basket data [ C ]//Proc of ACM SIGMOD International Conference on Management of Data. New York: ACM Press, 1997: 255-264.
  • 6MANNILA H, TOIVONEN H, VERKAMO A I. Efficient algorithms for discovering association rules[ C ]//Proc of the AAAI Workshop on Knowledge Discovery in Databases. Washington: AAAI Press, 1994: 181-192.
  • 7TOIVONEN H. Sampling large databases for association rules [ C ]// Proc of the 22nd International Conference on Very Large Data Bases. Sam Francisco: Morgan Kaufmann Publishers, 1996: 134-145.
  • 8HAN Jia-wei, PEI Jian, YIN Yi-wen. Mining frequent patterns without candidate generation [ C ]//Proc of ACM SIGMOD International Conference on Management of Data. New York : ACM Press, 2000 : 1-12.
  • 9GRAHNE G, ZHU Jian-fei. Efficiently using prefix-trees in mining frequent itemsets [ C ]//Proc of IEEE ICDM Workshop on Frequent Itemset Mining Implementations. 2003.
  • 10PIEPRZYK J, MORZY M. Mining generalized association roles using prutax and hierarchical bitmap index [ EB/OL ]. [ 2009-02-19]. http://www, cs. put. poznan, pl/mmorzy/papers/admkd07, pdf.

共引文献13

同被引文献15

  • 1李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法[J].计算机研究与发展,2006,43(9):1579-1585. 被引量：26
  • 2蒋君,邓倩妮.eMule系统中的非均匀性分布[J].微电子学与计算机,2007,24(10):153-156. 被引量：3
  • 3边肇祺,张学工.模式识别[M].北京:清华大学出版社,2006.
  • 4王建.基于KAD网络监督的关键技术研究与实现[D].成都:四川大学,2012.
  • 5Maymounkov P, Mazieres D.Kademlia: a peer-to-peer infor- matics system based on the XOR metric[C]//Proceedings of the lth International Workshop on P2P Systems, 2002: 53-65.
  • 6Cai Hua, Zhou Chunguang, Wang Zhe, et al.Algorithm research on community mining from dynamic social network[J].Jour- hal of Jinlin University,2008,26(4) : 380-382.
  • 7Berger-Wolf T Y, Saia J.A framework for analysis of dynamic social networks[C]//Proceeding of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2006,12 : 523-528.
  • 8Sarkar EDynamic social network analysis using latent space models[C]//Proceedings of the ACM SIGKDD Explora- tions Newsletter, 2005 : 31-35.
  • 9飞思科技产品研发中心神经网络理论与MATLAB7实现[M]//MATLAB应用技术.北京:电子工业出版社,2005:4-90.
  • 10赫南,李德毅,淦文燕,朱熙.复杂网络中重要性节点发掘综述[J].计算机科学,2007,34(12):1-5. 被引量：138

引证文献1

计算机应用研究
2010年 第9期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部