“…Basically, SPM algorithm produces sequential pattern that has several pattern, among others [13], [15], [20], [82]: itemset which is a set of items that are not empty, for example itemset denoted by i, where i = (i j , i j+1 , i j+2 , ..., i n ) and i j are item, then the sequence is an ordered list of several itemsets, if the sequence is denoted by s, then s = {s j , s j+1 , s j+2 , ..., s n } where s j is an itemset. A sequence A = {a 1 , a 2 , a 3 , ..., a n } is said to be subsequence of sequence B = {b 1 , b 2 , b 3 , ..., b n } and B is supersequence of A, if integers i 1 < i 2 < i 3 < ... < i n and a 1 ⊆ b i1 , a 2 ⊆ b i2 , a 3 ⊆ b i3 , ..., a n ⊆ b in .…”