MILPRIT*: A Constraint-Based Algorithm for Mining Temporal Relational Patterns

MILPRIT*: A Constraint-Based Algorithm for Mining Temporal Relational Patterns

Sandra de Amo, Waldecir P. Junior, Arnaud Giacometti
Copyright: © 2008 |Pages: 20
DOI: 10.4018/jdwm.2008100103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this article, we consider a new kind of temporal pattern where both interval and punctual time representation are considered. These patterns, which we call temporal point-interval patterns, aim at capturing how events taking place during different time periods or at different time instants relate to each other. The datasets where these kinds of patterns may appear are temporal relational databases whose relations contain point or interval timestamps. We use a simple extension of Allen’s Temporal Interval Logic as a formalism for specifying these temporal patterns. We also present the algorithm MILPRIT* for mining temporal point-interval patterns, which uses variants of the classical levelwise search algorithms. In addition, MILPRIT* allows a broad spectrum of constraints to be incorporated into the mining process. An extensive set of experiments of MILPRIT* executed over synthetic and real data is presented, showing its effectiveness for mining temporal relational patterns.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2024)
Volume 19: 6 Issues (2023)
Volume 18: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 17: 4 Issues (2021)
Volume 16: 4 Issues (2020)
Volume 15: 4 Issues (2019)
Volume 14: 4 Issues (2018)
Volume 13: 4 Issues (2017)
Volume 12: 4 Issues (2016)
Volume 11: 4 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing