Sequential Pattern Mining: Example I (Cont.)


Some terms are explained next before going further:
  • In a set of sequences a sequence s is maximal if s is not contained in any other sequence.
Customer Id Customer Sequence
1 { (30) (90) }
2 { (10 20) (30) (40 60 70) }
3 { (30 50 70) }
4 { (30) (40 70) (90) }
5 { (90) }
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.