期刊文献+

基于Web Service技术分布式并行数据挖掘的研究与实现 被引量:1

Reserch and Realization of Distributed and Parallel Data Mining Based on Web Service
下载PDF
导出
摘要 主要介绍基于Web Service技术的一个数据挖掘系统,在一个关联规则挖掘的并行算法—CD算法的基础上,结合一种基于动态数据集划分的并行关联规则挖掘算法,利用动态方式分配数据量,使每个处理器获得相同多的数据集,解决在网络中大量分散的数据因通信等问题而引起的负载平衡,从而提高了数据挖掘效率。 The paper gives a distributed data mining system based on Web Services. On the basis of CD algorithm,the paper presents a parallel algorithm for mining association rules based on dynamic dataset partition. By uning dynamic method to allocate data,a processor can obtain same dataset. Since it solves the load balance better because of the problems of distributed -data and communication,improves the efficiency of data mining.
出处 《现代电子技术》 2008年第10期42-44,共3页 Modern Electronics Technique
关键词 WEB服务 关联规则 并行数据挖据 动态数据集 Web service association rules parallel data mining dynamic dataset
  • 相关文献

参考文献3

二级参考文献16

  • 1杨君锐.关联规则增量式快速更新方法的研究[J].微电子学与计算机,2004,21(9):120-124. 被引量:7
  • 2郑丽英.基于trie的关联规则发现算法[J].兰州理工大学学报,2004,30(5):90-92. 被引量:3
  • 3Agrawal 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.
  • 4Agrawal 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.
  • 5Agrawal 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.
  • 6Maurice Houtsma, Arun Swami. Set-oriented mining of association rules [A]. Research report RJ9567, IBM almaden research center[C]. San Jose, California: [s.n.], 1993.
  • 7Park 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.
  • 8Ashok 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.
  • 9Brin 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.
  • 10David 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.

共引文献64

同被引文献5

引证文献1

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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