Mining Top-k Closed Sequential Patterns in Sequential Databases

Abstract

In data mining community, sequential pattern mining has been studied extensively. Most studies require the specification of minimum support threshold to mine the sequential patterns. However, it is difficult for users to provide an appropriate threshold in practice. To overcome this, we propose mining top-k closed sequential patterns of length no less than min_l, where k is the number of closed sequential patterns to be mined, and min_l is the minimum length of each pattern. We mine closed patterns since they are solid representations of frequent patterns.