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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Data Warehousing and Mining
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
