Abstract
The Internet reports massive news event every day. Sequential pattern mining is adopted to study the timing relationship between news event, which can provide reference for the development or prediction of news events. With its advantages in performance and efficiency, PrefixSpan often becomes preferred algorithm in the field of sequence pattern mining. But unfortunately, because of the large amount of news and the long time span between some news events, the event sequences is long and dense, which results many subsequences in the frequent pattern and reduces the algorithm performance. In this paper, we propose an improved PrefixSpan algorithm by integrate subsequences of the supersequences in the frequent pattern and introduce news event weight in the pruning step of the PrefixSpan algorithm. Experiment results show that without affecting expression ability of frequent patterns, the improved PrefixSpan algorithm increases the efficiency by about 20 times as before and eliminates about 10% of the redundant subsequences to get a more concise frequent patterns set.
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.
