Abstract
PrefixSpan algorithm will construct huge amount of projected databases in the process of mining sequence patterns, especially mining dense dataset and long sequence pattern, which will cause decline of the performance of the algorithm. The resource problem can be solved by Projection position-based Sequential Pattern Mining Algorithm so as to reduce time and storage space. In order to avoid producing huge amount of projected databases and reduce unnecessary storage space and scanning time, compared with the others improved algorithm, the PSPM utilizes projected position to locate projected sequence position for mining local frequency items and deletes the non-frequent items. Experiment results demonstrate that PSPM outperforms the PrefixSpan(with pseudo-pro) algorithm in the aspect of Runtime performance.
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.
