Mining Time-Constrained Sequential Patterns with Constraint Programming

摘要

This abstract is related to the original paper in the Constraint Journal [1]. Constraint Programming has proven to be an effective platform for constraint-based sequential pattern mining. Previous work has focussed on standard sequential pattern mining, as well as sequential pattern mining with a maximum 'gap' between two matching events in a sequence. The main challenge in the latter is that this constraint can not be imposed independently of the omnipresent frequency constraint. In this work, we go beyond that and investigate the integration of timed events, the gap constraint as well as the span constraint that constrains the time between the first and last matching event. We show how the three are interrelated, and what the required changes to the frequency constraint are.