Abstract

Partial periodic pattern mining is one of the important issues in the field of data mining due to its practical applications. A partial periodic pattern consists of some periodic and non-periodic events in a specific period length, and is repeated with high frequency in an event sequence. In the past, a max-subpattern hit set algorithm was developed to discover partial periodic patterns, but its drawback is spending a large amount of time in calculating frequency counts from the redundant candidate nodes. In this study, we thus adopt an efficient encoding strategy to speed up the efficiency of processing period segments in an event sequence, and combined with the projection method to quickly find the partial periodic patterns in the recursive process. Finally, the experimental results show the superior performance of the proposed approach.

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 call

Disclaimer: 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.