GPS algorithm: it is used to find frequent itemsets with sequential order from the candidate item set. Two steps: self-connection and pruning. Disadvantages: Every time the support is calculated, all data sets need to be scanned; for the case of a very long sequence pattern, the algorithm is difficult to handle because the scale of the corresponding short sequence pattern is too large.