期刊文献+

一种基于投影树的并行序列挖掘算法

a Parallel Sequence Mining Algorithm Based on Tree-projection
下载PDF
导出
摘要 在许多科学和商业领域,序列模式的发现技术发挥着越来越重要的作用,然而人们对于高效的基于投影树算法的并行模式关注较少。该文首先介绍了频繁序列挖掘模式的基本概念,然后基于投影树算法,提出了分布式存储并行序列挖掘算法,并对算法的性能进行了详细的分析。 Discovery of sequential patterns is becoming increasingly useful in many scientific and commercial domains.However,parallel formulations of the efficient projection-based algorithms has received little attention.The paper briefly introduces the basic concept of frequent sequence mining,then presents a distributed-memory parallel sequence mining algorithm.Moreover,a detailed analysis of the performance for the algorithm is proposed in this paper.
出处 《计算机工程与应用》 CSCD 北大核心 2004年第14期4-5,56,共3页 Computer Engineering and Applications
基金 中国科学院知识创新工程方向性研究项目基金(名称:大型数字对象应用环境及其并行模拟 批准号:KGCX2-JG-09) 国家部委项目基金资助
关键词 数据挖掘 投影算法 并行处理 频繁序列模式 data mining,projection algorithm,parallel processing,frequent sequential patterns
  • 相关文献

参考文献4

  • 1R Srikant,R Agrawal. Mining sequential patterns:Generalizations and performance improvements[C].In:Proc of the Fifth Int′l Conference on Extending Database Technology ,Avignon ,France, 1996
  • 2R C Agarwall,C Aggarwal,V V V Prasad. A tree projection algorithhm for generation of frequent itemsets[J].Journal of Parallel and Distributed Computing(Special Issue on High Performance Data Mining),2000
  • 3R Agrawal,J C Shafer. Parallel mining of association rules[J].IEEE Transactions on Knowledge and Data Eng, 1996; 8 (6): 962~969
  • 4Ananth Grama,Anshul Gupta,George Karypis et al. Introduction to parallel Computing:Design and Analysis of Algorithms[M].2nd Edition,Adison Wesley Publishing Company,Redwood City,CA,2003

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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