Efficient constraint evaluation in categorical sequential pattern mining for trajectory databases

The classic Generalized Sequential Patterns (GSP) algorithm returns all frequent sequences present in a database. However, usually a few ones are interesting from a user's point of view. Thus, post-processing tasks are required in order to discard uninteresting sequences. To avoid this drawback, languages based on regular expressions (RE) were proposed to restrict frequent sequences to the ones that satisfy user-specified constraints. In all of these languages, REs are applied over items, which limits their applicability in complex real-world situations. We propose a much powerful language, based on regular expressions, denoted RE-SPaM, where the basic elements are constraints defined over the (temporal and non-temporal) attributes of the items to be mined. Expressions in this language may include attributes, functions over attributes, and variables. We specify the syntax and semantics of RE-SPaM, and present a comprehensive set of examples to illustrate its expressive power. We ...

• Type: Conference
• Year: 2009
• Where: EDBT
• Authors: Leticia I. Gómez, Alejandro A. Vaisman
• Keywords: Database, EDBT 2009, Frequent Sequences, Generalized Sequential Patterns, Regular Expressions