Discovery of sequential patterns is becoming increasingly useful and essential in many scientific and commercial domains. Enormous sizes of available datasets and possibly large number of mined patterns demand efficient and scalable algorithms. In this paper we present two parallel formulations of a serial sequential pattern discovery algorithm based on tree projection that are well suited for distributed memory parallel computers. Our experimental evaluation on a 32 processor IBM SP show that these algorithms are capable of achieving good speedups, substantially reducing the amount of the required work to find sequential patterns in large databases.
|Original language||English (US)|
|Title of host publication||Euro-Par 2001 Parallel Processing - 7th International Euro-Par Conference, Proceedings|
|Editors||Rizos Sakellariou, John Gurd, Len Freeman, John Keane|
|Number of pages||11|
|ISBN (Electronic)||3540424954, 9783540424956|
|State||Published - 2001|
|Event||7th European Conference on Parallel Computing, Euro-Par 2001 - Manchester, United Kingdom|
Duration: Aug 28 2001 → Aug 31 2001
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||7th European Conference on Parallel Computing, Euro-Par 2001|
|Period||8/28/01 → 8/31/01|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.