E cient Mining of Frequent Closed Sequences from a Single Long Data Sequence

Abstract

In this paper, we propose an e cient algorithm for mining frequent right-closed sequences from a single long sequences without candidate generation. The purpose is to compress a huge set of frequent sequences, extracting in mining process. To measure the frequency of each sequences, we adopt the Head frequency which can count multiple occurrences of each subsequence without irrational duplications. The search space can largely be reduced by applying right-anti-monotonicity of the head frequency.