Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
