节点文献
一种基于投影树的并行序列挖掘算法
a Parallel Sequence Mining Algorithm Based on Tree-projection
【摘要】 在许多科学和商业领域,序列模式的发现技术发挥着越来越重要的作用,然而人们对于高效的基于投影树算法的并行模式关注较少。该文首先介绍了频繁序列挖掘模式的基本概念,然后基于投影树算法,提出了分布式存储并行序列挖掘算法,并对算法的性能进行了详细的分析。
【Abstract】 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.
【关键词】 数据挖掘;
投影算法;
并行处理;
频繁序列模式;
【Key words】 data mining; projection algorithm; parallel processing; frequent sequential patterns;
【Key words】 data mining; projection algorithm; parallel processing; frequent sequential patterns;
【基金】 中国科学院知识创新工程方向性研究项目基金(名称:大型数字对象应用环境及其并行模拟,批准号:KGCX2-JG-09);国家部委项目基金资助
- 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2004年14期
- 【分类号】TP311
- 【被引频次】1
- 【下载频次】83