{
bread, milk}
.
〈
{
milk}
{
bread, milk}
〉
.
|
|
s
if s
is contained in the customer-sequence for this customer.
Given a database D
of customer transactions the problem of mining sequential patterns is to find the maximal sequences among all sequences that have a certain user-specified minimum support.
Each such maximal sequence represents a sequential pattern.
A sequence satisfying the minimum support constraint is called a large sequence.
Boss: What’s your biggest weakness? Me: Honesty. Boss: I don’t consider that a weakness. Me: I don’t give a f*ck what you think. |