毕业论文（设计）序列模式挖掘及其应用研究.docVIP

序列模式挖掘及其应用研究 摘 要 序列模式挖掘是数据挖掘研究的一个重要的研究领域。目前，成熟的序列模式挖掘算法主要有三类：基于Apriori性质的候选码生成-测试的算法；基于垂直格式的候选码生成-测试的算法；基于投影数据库的模式增长算法。近年来，序列模式挖掘在分布式环境下的应用的研究逐渐成为热点，提出了各种算法。本文介绍序列模式挖掘算法及各自的优缺点和在分布式环境下的应用，在此基础上发现了分布式环境下站点之间局部模式子树的传输存在问题。本文提出了分布式环境下基于叶子节点传输的序列模式挖掘方法LMSP(leaf-based mining of sequential patterns)，即在生成全局L2序列模式的过程中，各站点传输局部L2子树时只传输局部子树的叶子节点的序列以及所有节点的支持度计数，在选举站点上再根据接收到的子树信息将局部L2子树还原。接着又简单地提出约减的树结构的传输，除根节点外的每个节点都只记录相对其父节点的后缀序列。实验结果表明，LMSP算法性能优于FDMSP算法。文章最后简单的介绍了序列模式挖掘的实际应用。 关键词：数据挖掘；序列模式；分布式算法；数据传输 Abstract Sequential pattern mining is an important domain of data mining. Now there are three types of mature algorithms of sequential patterns mining: Apriori-based algorithms by candidate sequence generating-and-testing; vertical format database based algorithms by candidate sequence generating-and-testing; projection database based algorithms with by pattern-growth. In recent years, mining of sequential patterns in distributed environment is becoming hot topic, and some algorithms have been proposed. In this paper, three algorithms of sequential pattern mining and advantages and disadvantages of them are introduced, and then the applications of sequential pattern mining algorithms in distributed environment. Since this, we find a problem of local pattern subtree transportation from one site to another in distributed environment. In this paper, we propose a leaf-based algorithm in distributed environment, LMSP (leaf-based mining of sequential patterns), only transport the leaf node sequences and all the support counts of the local L2 subtree, while every site transporting the local L2 subtree to polling site in the course of global L2 patterns generating. At polling site, we get the local L2 subtree back from received subtree message. And we also propose transportation of reduction subtree simply， all the nodes (except the root) register only suffix according to its parent instead of the entire sequence. The experiments show that the algorithm LMSP outperforms the algorithm F