分布式序列模式发现算法的研究 .pdf

1000-9825/2005/16(07)1262 ©2005 Journal of Software 软 件 学 报 Vol.16, No.7 ∗ 分布式序列模式发现算法的研究 1,2+ 2 2 2 邹 翔 , 张 巍 , 刘 洋 , 蔡庆生 1(公安部第三研究所 科研中心,上海 200031) 2( 中国科学技术大学 计算机科学系,安徽 合肥 230027) Study on Distributed Sequential Pattern Discovery Algorithm 1,2+ 2 2 2 ZOU Xiang , ZHANG Wei , LIU Yang , CAI Qing-Sheng 1(Research Center, The Third Research Institute of Ministry of Public Security, Shanghai 200031, China) 2(Department of Computer Science, University of Science and Technology of China, Hefei 230027, China) + Corresponding author: Phn: +86-21 Fax: +86-21 E-mail: xiangz@, Received 2003-11-13; Accepted 2005-02-03 Zou X, Zhang W, Liu Y, Cai QS. Study on distributed sequential pattern discovery algorithm. Journal of Software, 2005,16(7):1262−1269. DOI: 10.1360/jos161262 Abstract : Algorithm FDMSP (fast distributed mining of sequential patterns) is proposed in order to deal with mining sequential patterns in distributed environment and its properties are analyzed. The algorithm utilizes prefix-projected technique to divide the pattern searching space, utilizes polling site associated with prefix to get a global support, and utilizes local pruning, poll pruning and count pruning to decrease candidate sequences. It is divided into three sub-procedures which run asynchronously. As a result, the algorithm has lower I/O cost, memory cost and communication cost, and global sequential patterns are generated with higher efficiency. The experiments show that it outperforms the algorithm GSP after centralizing data by 68.5% to 99.5% and scaleable over LAN with huge amo