Parallel Tree Projection Algorithm for Sequence Mining
2001-03-29
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
Parallel Tree Projection Algorithm for Sequence Mining
Published Date
2001-03-29
Publisher
Type
Report
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.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Guralnik, Valerie; Garg, Nivea; Karypis, George. (2001). Parallel Tree Projection Algorithm for Sequence Mining. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215464.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.