Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of first order temporal pattern, specified in Allen's Temporal Interval Logic, where time is explicitly represented by intervals. We present the algorithm MILPRIT for mining temporal interval patterns, which uses variants of the classical level-wise search algorithms. MILPRIT allows a broad spectrum of constraints over temporal patterns to be incorporated in the mining process. Some experimental results over synthetic and real data are presented. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
De Amo, S., Giacometti, A., & Junior, W. P. (2007). Mining first-order temporal interval patterns with regular expression constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4654 LNCS, pp. 459–469). Springer Verlag. https://doi.org/10.1007/978-3-540-74553-2_43
Mendeley helps you to discover research relevant for your work.