![]() |
CiteULike | ![]() |
amsantos's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Mining Sequential Patterns: Generalizations and Performance Improvementsedited by: Peter M. G. Apers, Mokrane Bouzeghoub, Georges GardarinIn Proc. 5th Int. Conf. Extending Database Technology, EDBT, Vol. 1057 (FebruaryMay--FebruarySeptember~ 1996), pp. 3-17.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
Abstract: The problem of mining sequential patterns was recently introduced in [AS95]. We are given a database of sequences, where each sequence is a list of transactions ordered by transaction-time, and each transaction is a set of items. The problem is to discover all sequential patterns with a user-specified minimum support, where the support of a pattern is the number of data-sequences that contain the pattern. An example of a sequential pattern is "5% of customers bought `Foundation' and...
BibTeX record
RIS record