基于序列模式的序列聚类挖掘算法分析-计算机应用技术专业论文.docxVIP

Abstract Sequential pattern mining is to discover hidden and interesting sequence relationships between events from large sequence databases, and to tap out the high frequent sequential patterns of time-based or other sequences. Sequence pattern mining makes up for the shortcomings that association rule mining does not reflect the chronological order relevance between events. Sequential pattern mining has been widely applied in many fields, such as Customer Buying Behavior Analysis, DNA Sequence Pattern Analysis and etc. This paper focuses on the problem that sequential database has been further clustered by using K-means algorithm on the basis of the results of sequential pattern mining. In the paper, a new algorithm named K-SPAM(K-means algorithm of sequence pattern mining based on the Huffman Method) is proposed on the basis of Huffman tree’s structure ideas. This algorithm addresses this shortcoming that it could lead to the instability of clustering results to select the initial center randomly in the k-means clustering algorithm. K-SPAM realizes the function that data sequences containing similar patterns are clustered. Huffman’s ideas are adopted to select initial center in the k-means algorithm. As a result, the number of iterations are reduced and the stability of clustering is also improved. Finally, the K-SPAM algorithm has been compared with k-means algorithm about the clustering results by the experimental method, to further confirm the advantages of the K-SPAM algorithm. Keywords: data mining; sequence pattern; k-means; dissimilarity; Huffman algorithm - III - 目 录 独创性声明I 摘 要 II ABSTRACT III 第一章 绪论1 1.1 论文选题依据和研究意义 1 1.2 序列模式挖掘国内外研究现状 2 1.3 聚类研究国内外研究现状 3 1.4 主要工作 5 1.5 论文结构 5 第二章 序列模式挖掘7 2.1 序列模式挖掘的提出 7 2.2 序列模式基本概念和有关定义 8 2.3 经典的序列模式挖掘算法 9 AprioriAll 算法 9 GSP 算法 10 基于投影技术的 FreeSpan、PrefixSpan 算法 11 SPADE 算法 13 SPAM 算法 14 2.4 几种算法的比较 16 2.5 本章小结 17 第三章 聚类研究18 3.1 聚类的概念和应用 18 3.2 聚类数据对象间的相异度 19 3.3 主要的聚类算法 22 3.3.1 基于划分的聚类方法22 3.3.2 基于层次的聚类方法23 3.