RE-SPaM: Using Regular Expressions for Sequential Pattern Mining in Trajectory Databases
Authors:
- Leticia I. GómezLGLeticia I. Gómez
- Alejandro A. VaismanAVAlejandro A. Vaisman
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 23759232,p. 395-398
Abstract
In sequential pattern mining, languages based on regular expressions (RE) were proposed to restrict frequent sequences to the ones that satisfy user-specified constraints. In these languages, REs are applied over items. We propose a much powerful language, based on regular expressions, denoted RE-SPaM, where the basic elements are constraints over the attributes of the items. Expressions in this language may include attributes, functions over attributes, and variables. We present the data model, sketch the syntax and semantics of RE-SPaM, a set of examples, and suggest how it can be used in the mining process.Keywords
This publication has 4 references indexed in Scilit:
- A conceptual view on trajectoriesData & Knowledge Engineering, 2008
- Mining sequential patterns2002
- Mining sequential patterns with regular expression constraintsIEEE Transactions on Knowledge and Data Engineering, 2002
- A foundation for representing and querying moving objectsACM Transactions on Database Systems, 2000