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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Database transactionComputer scienceTransaction dataTransaction processingScale (ratio)Online transaction processingData miningDatabase
Affiliated Institutions
Related Publications
An ID-based cryptosystem based on the discrete logarithm problem
In a modern network system, data security technologies such as cryptosystems, signature schemes, etc., are indispensable for reliable data transmission. In particular, for a lar...
An effective hash-based algorithm for mining association rules
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the pro...
Mining association rules between sets of items in large databases
We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates a...
Inference aggregation detection in database management systems
The author identifies inference aggregation and cardinality aggregation as two distinct aspects of the aggregation problem. He develops the concept of a semantic relationship gr...
A statistical method for global optimization
An algorithm for finding global optima using statistical prediction is presented. Assuming a random function model, lower confidence bounds on predicted values are used for sequ...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 3-14
- Citations
- 5114
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
5114
OpenAlex
Cite This
R. K. Agrawal,
Ramakrishnan Srikant
(2002).
Mining sequential patterns.
, 3-14.
https://doi.org/10.1109/icde.1995.380415
Identifiers
- DOI
- 10.1109/icde.1995.380415