Mining Sequential Patterns: Generalizations and Performance Improvements

by: Ramakrishnan Srikant, Rakesh Agrawal

edited by: Peter MG Apers, Mokrane Bouzeghoub, Georges Gardarin

Vol. 1057 (FebruaryMay--FebruarySeptember~ 1996), pp. 3-17.

View FullText article

CiteSeer (at Penn State), CiteSeer (at MIT), CiteSeer (at Zurich), CiteSeer (at Singapore)

Reviews [Write a review of this article]

There are no reviews of this article

Find related articles from these CiteULike users

bluestan, rahul, jcsilva, ehaimerl, amsantos, EmreSevinc, SRL (group)

Find related articles with these CiteULike tags

algorithm, almaden, datamining, gsp, machine-learning, mining, pattern, patterns, reference, sequence, sequential

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...

@inproceedings{citeulike:549381, 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...}, author = {Srikant, Ramakrishnan and Agrawal, Rakesh }, booktitle = {Proc. 5th Int. Conf. Extending Database Technology, EDBT}, citeulike-article-id = {549381}, editor = {Apers, Peter M. G. and Bouzeghoub, Mokrane and Gardarin, Georges }, keywords = {algorithm}, month = {FebruaryMay--FebruarySeptember~}, pages = {3--17}, posted-at = {2006-03-13 10:18:47}, priority = {3}, publisher = {Springer-Verlag}, title = {Mining Sequential Patterns: Generalizations and Performance Improvements}, url = {http://citeseer.ist.psu.edu/189.html}, volume = {1057}, year = {1996} }

RIS record

TY - CONF ID - citeulike:549381 L3 - citeulike-article-id:549381 TI - Mining Sequential Patterns: Generalizations and Performance Improvements T2 - Proc. 5th Int. Conf. Extending Database Technology, EDBT VL - 1057 SP - 3 EP - 17 PB - Springer-Verlag N2 - : 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... KW - algorithm AU - Srikant, Ramakrishnan AU - Agrawal, Rakesh A2 - Apers, Peter A2 - Bouzeghoub, Mokrane A2 - Gardarin, Georges PY - 1996/25--29~// UR - http://citeseer.ist.psu.edu/189.html ER -

RIS BibTeX