Parallel tree projection algorithm for sequence mining

Valerie Guralnik, Nivea Garg, George Karypis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Scopus citations

Abstract

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 languageEnglish (US)
Title of host publicationEuro-Par 2001 Parallel Processing - 7th International Euro-Par Conference, Proceedings
EditorsRizos Sakellariou, John Gurd, Len Freeman, John Keane
PublisherSpringer Verlag
Pages310-320
Number of pages11
ISBN (Electronic)3540424954, 9783540424956
DOIs
StatePublished - 2001
Event7th European Conference on Parallel Computing, Euro-Par 2001 - Manchester, United Kingdom
Duration: Aug 28 2001Aug 31 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2150
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other7th European Conference on Parallel Computing, Euro-Par 2001
CountryUnited Kingdom
CityManchester
Period8/28/018/31/01

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.

Fingerprint Dive into the research topics of 'Parallel tree projection algorithm for sequence mining'. Together they form a unique fingerprint.

Cite this