ITM Web Conf.
Volume 45, 20222021 3rd International Conference on Computer Science Communication and Network Security (CSCNS2021)
|Number of page(s)||6|
|Section||Computer Technology and System Design|
|Published online||19 May 2022|
Design of a prefixspan algorithm based on prefix position form
Nanjing University of Science and Technology, School of Automation, Nanjing, China
* Corresponding author: email@example.com
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.
Key words: PrefixSpan / Prefix position form / Repetitive projection database
© The Authors, published by EDP Sciences, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.