Parallel sequence mining on shared-memory machines

Mohammed J. Zaki

doi:10.1006/jpdc.2000.1695

Parallel sequence mining on shared-memory machines

2001-03-01

48

OA

AI

M

Mohammed J. Zaki *

DOI：10.1006/jpdc.2000.1695

原文链接

查看原文

摘要

En 中文

We present pSPADE, a parallel algorithm for fast discovery of frequent sequences in large databases. pSPADE decomposes the original search space into smaller suffix-based classes. Each class can be solved in main-memory using efficient search techniques and simple join operations. Furthermore, each class can be solved independently on each processor requiring no synchronization. However, dynamic interclass and intraclass load balancing must be exploited to ensure that each processor gets an equal amount of work. Experiments on a 12 processor SGI Origin 2000 shared memory system show good speedup and excellent scaleup results. (C) 2001 Academic Press.

Keyword:

knowledge discovery

data mining

sequential patterns

frequent sequences

temporal association rules

Parallel sequence mining on shared-memory machines

摘要

AI总结

期刊

机构

引用论文