期刊文献+

分布式数据库关联规则挖掘研究

Research on Mining Association Rules in Distributed System
下载PDF
导出
摘要 在分布式系统中如何挖掘关联规则是数据挖掘领域研究的一个重要课题.对关联规则分布式挖掘问题进行了深入探讨.基于以P2P网络模式构建的分布式事务数据库,对Apriori算法进行了推广.改进后的算法具有扩展性好、效率高、通信代价小和实现简单等优点.最后,还提出了一种由频繁项集高效产生强关联规则的算法. It's a very important subject in the domain of data mining of how to mine association rules in distributed database system. The paper makes a thorough research on this subject. Based on distributed transactional database system constructed by P2P, the paper extends the most classical algorithm Apriori. This improved algorithm has sound extension, simple time complexity, small communication cost and simplicity. At last, the paper puts forward an efficient algorithm of getting association rules from frequent itemsets.
出处 《温州师范学院学报》 2006年第2期72-76,共5页 Journal of Wenzhou Teachers College(Philosophy and Social Science Edition)
关键词 P2P 关联规则 数据挖掘 分布式 事务数据库 P2P association rules data mining distribution transactional database
  • 相关文献

参考文献8

  • 1Agrawal R,Strikant R.Fast algorithms for mining association rules in large databases[A].Proceedings of the 20th international conference on very large databases[C].New York:Institute of Electrical and Electronics Engineers,1994.
  • 2Park J S,Chen M,PS Yu.An effective hash-based algorithm for mining association rules[A].Proc of the ACM SIGMOD Int'l Confon Management of Data[Al.Jose,CA,1995.175~186.
  • 3Ashok Savasere,Edward Omiecinski,Shamkant Navathe.An efficient algorithm for mining association rules in large database[A].Proceeding of the VLDB conference[C].Zurich Switzerland,1995.432~444.
  • 4李小兵,吴锦林,薛永生,翁伟.关联规则挖掘算法的改进与优化研究[J].厦门大学学报(自然科学版),2005,44(4):468-471. 被引量:9
  • 5葛丽娜,钟诚.一个有效的分布式并行挖掘关联规则算法[J].计算机工程与设计,2004,25(8):1258-1260. 被引量:6
  • 6陈晓云,陈晓辉.分布数据库关联规则挖掘[J].福州大学学报(自然科学版),2002,30(4):510-513. 被引量:3
  • 7赵斌,吉根林.分布式系统中关联规则挖掘研究[J].小型微型计算机系统,2003,24(12):2270-2271. 被引量:8
  • 8JiaweiHansMichelineKamber著,范明,孟小峰(译).数据挖掘概念与技术[M].北京:机械工业出版社,2004.150~184.

二级参考文献23

  • 1谭会晓 李建中.挖掘关联规则中的并行算法.兰州大学学报:自然科学版,1999,(35):359-363.
  • 2Agrawal R, Imielinski T, Swami A. Mining association rules between sets of items in large databases [A]. Proceedings of ACM SIGMOD[C]. New York: Association for Computer Machinery,1993.207-216.
  • 3Agrawal R, Srikant R. Fast algorithms for mining association rules in large databases [A]. Proceedings of the 20th international conference on very large databases [C]. New York: Institute of Electrical and Electronics Engineers, 1994.
  • 4Agrawal R, Srikant R. Mining sequential patterns[A]. Proc of the 1 1th Int'l conference on data engineering [C]. Washington, D.C:IEEE Computer Society Press, 1995.
  • 5Maurice Houtsma, Arun Swami. Set-oriented mining of association rules [A]. Research report RJ9567, IBM almaden research center[C]. San Jose, California: [s.n.], 1993.
  • 6Park J S, Chen M, PS Yu. An effective hash-based algorithm for mining association rules[C]. Proc of the ACM SIGMOD Int'l Confon Management of Data, San Jose, CA, 1995. 175-186.
  • 7Ashok Savasere Edward Omiecinski Shamkant Navathe. An efficient algorithm for mining association rules in large database[C]. Proceeding of the VLDB Conference, Zurich Switzerland,1995.432 -444.
  • 8Brin S, Motwani R, Ullman J, et al. Dynamic itemset counting and implication rules for market basket data[C]. Proc the 1997 ACM-SIGMOD Conference on Management of Data, 1997.255-264.
  • 9David W Cheung, Kan Hu Shaowei Xia. Asynchronous parallel algorithm for mining association rules on a shared-memory multi-processors[C]. 10th ACM Symp Parallel Algorithm and Architectures, 1998. 279- 288.
  • 10Zaki M J, Parthasarathy S, Ogihara M, et al. New algorithms for fast discovery of association rules[C]. 3rd Intl. Conf on Knowledge Discovery and Data Mining, 1997. 283-286.

共引文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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