Mining sequential patterns
Top Cited Papers
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We are given a large database of customer transactions, where each transaction consists of customer-id, transaction time, and the items bought in the transaction. We introduce the problem of mining sequential patterns over such databases. We present three algorithms to solve this problem, and empirically evaluate their performance using synthetic data. Two of the proposed algorithms, AprioriSome and AprioriAll, have comparable performance, albeit AprioriSome performs a little better when the minimum number of customers that must support a sequential pattern is low. Scale-up experiments show that both AprioriSome and AprioriAll scale linearly with the number of customer transactions. They also have excellent scale-up properties with respect to the number of transactions per customer and the number of items in a transaction.<>Keywords
This publication has 7 references indexed in Scilit:
- Combinatorial pattern discovery for scientific dataACM SIGMOD Record, 1994
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993
- Fast text searchingCommunications of the ACM, 1992
- A search for common patterns in many sequencesBioinformatics, 1992
- Basic Local Alignment Search ToolJournal of Molecular Biology, 1990
- A fast and sensitive multiple sequence alignment algorithmBioinformatics, 1989
- Discovering patterns in sequences of eventsArtificial Intelligence, 1985