Fast time intervals mining using the transitivity of temporal relations

Research output: Contribution to journalArticlepeer-review

73 Scopus citations


We introduce an algorithm, called KarmaLego, for the discovery of frequent symbolic time interval-related patterns (TIRPs). The mined symbolic time intervals can be part of the input, or can be generated by a temporal-abstraction process from raw time-stamped data. The algorithm includes a data structure for TIRP-candidate generation and a novel method for efficient candidate-TIRP generation, by exploiting the transitivity property of Allen’s temporal relations. Additionally, since the non-ambiguous definition of TIRPs does not specify the duration of the time intervals, we propose to pre-cluster the time intervals based on their duration to decrease the variance of the supporting instances. Our experimental comparison of the KarmaLego algorithm’s runtime performance with several existing state of the art time intervals pattern mining methods demonstrated a significant speed-up, especially with large datasets and low levels of minimal vertical support. Furthermore, pre-clustering by time interval duration led to an increase in the homogeneity of the duration of the discovered TIRP’s supporting instances’ time intervals components, accompanied, however, by a corresponding decrease in the number of discovered TIRPs.

Original languageEnglish
Pages (from-to)21-48
Number of pages28
JournalKnowledge and Information Systems
Issue number1
StatePublished - 1 Jan 2015


  • Frequent pattern mining
  • Temporal abstraction
  • Temporal knowledge discovery
  • Time intervals mining
  • Transitivity

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Human-Computer Interaction
  • Hardware and Architecture
  • Artificial Intelligence


Dive into the research topics of 'Fast time intervals mining using the transitivity of temporal relations'. Together they form a unique fingerprint.

Cite this