| Summary: | PrefixSpan algorithm based on sequence pattern is an association algorithm without generating candidate sequences and only needs to scan the original sequence database twice in the whole operation process. Compared with other sequence algorithms, the PrefixSpan algorithm is more efficient and fast. In this paper, PrefixSpan Base on Prefix Position Form, PPFPrefixSpan is proposed by studying the characteristics of the PrefixSpan algorithm and optimizing it based on it. , which solves the problem that the PrefixSpan algorithm produces too many duplicate projection databases in the process of operation, and optimates the PrefixSpan algorithm in space/time.
|
|---|