ACM Home Page
Please provide us with feedback. Feedback
Mining Sequential Patterns
Full text Publisher SitePublisher Site
Source ICDE archive
Proceedings of the Eleventh International Conference on Data Engineering table of contents
Pages: 3 - 14  
Year of Publication: 1995
ISBN:0-8186-6910-1
Authors
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): n/a,   Downloads (12 Months): n/a,   Citation Count: 457
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

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.


CITED BY  458

Collaborative Colleagues:
Rakesh Agrawal: colleagues
Ramakrishnan Srikant: colleagues