Abstract
Aiming at the problem of constructing huge amounts of projected databases in PrefixSpan algorithm, this paper proposes an Improved PrefixSpan algorithm for Mining Sequential Patterns, called BLSPM algorithm (based on bi-level Sequential Patterns Mining). The algorithm use duplicated projection and certain specific sequential patterns pruning, reduce the scale of projected databases and the runtime of scanning projected databases, thus, the efficiency of algorithm could be raised up greatly, and all needed sequential patterns are obtained. Experiment results shows that BLSPM algorithm is more efficient than PrefixSpan algorithm in large databases.
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.
