Abstract
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.
Similar content being viewed by others
Notes
Karma—The law of cause and effect originated in ancient India and is central to Hindu and Buddhist philosophies.
Lego—A popular game, in which modular bricks are used to construct different objects.
References
Allen JF (1983) Maintaining knowledge about temporal intervals. Commun ACM 26(11):832–843
Ayres J, Gehrke J, Yiu T, Flannick J (2002) Sequential pattern mining using bitmaps. In: Proceedings SIGKDD international conference on knowledge discovery and data mining. Edmonton, Alberta
Azulay R, Moskovitch R, Stopel D, Verduijn M, de Jonge E, Shahar Y (2007) Temporal discretization of medical time series: a comparative study. IDAMAP, Amsterdam
Batal I, Sacchi L, Bellazzi R, Hauskrecht M (2009) A temporal abstraction framework for classifying clinical temporal data. American Medical Informatics Association (AMIA) Annual Symposium Proceedings, pp 29–33
Bellazzia R, Diomidousb M, Takabayashid K, Zieglere A, McCray AT (2011) Data analysis and data mining: current issues in biomedical informatics. Methods Inf Med 50(6):536–544
Freksa C (1992) Temporal reasoning based on semi-intervals. Artif Intell 54(1):199–227
Fu TK (2011) A review on time series data mining. Eng Appl Artif Intell 24:164–181
Höppner F (2001) Learning temporal rules from state sequences. In: Proceedings of WLTSD-01
Höppner F (2002) Time series abstraction methods: a survey. In: Workshop on knowledge discovery in databases. Dortmund
Jakkula VR, Cook DJ (2011) Detecting anomalous sensor events in smart home data for enhancing the living experience. Artificial intelligence and smarter living, WS-11-07 of AAAI Workshops, AAAI
Kam PS, Fu AWC (2000) Discovering temporal patterns for interval based events. In: Proceedings DaWaK-00
Lavrač N, Keravnou-Papailiou E, Zupan B (1997) Intelligent data analysis in medicine and pharmacology. The Springer international series in engineering and computer science, vol 414. Kluwer Academic Publishers, Boston/Dordrecht/London
Lin J, Keogh E, Lonardi S, Chiu B (2003) A symbolic representation of time series with implications for streaming algorithms. In: ACM SIGMOD DMKD workshop
Mörchen F, Ultsch A (2005) Optimizing time series discretization for knowledge discovery. In: Proceeding of KDD
Mörchen F (2006) Algorithms for time series knowledge mining. In: Proceedings of KDD
Moskovitch R, Stopel D, Verduijn M, Peek N, de Jonge E, Shahar Y (2007) Analysis of ICU patients using the time series knowledge mining method. IDAMAP, Amsterdam
Moskovitch R, Elovici Y, Rokach L (2008) Detection of unknown computer worms based on behavioral classification of the host. Comput Stat Data Anal 52(9):4544–4566
Moskovitch R, Shahar Y (2009) Medical temporal-knowledge discovery via temporal abstraction. AMIA, San Francisco
Moskovitch R, Peek N, Shahar Y (2009) Classification of ICU patients via temporal abstraction and temporal patterns mining, IDAMAP 2009. Verona
Papapetrou P, Kollios G, Sclaroff S, Gunopulos D (2009) Mining frequent arrangements of temporal intervals. Knowl Inf Syst 21(2):133–171
Patel D, Hsu W, Lee ML (2008) Mining relationships among interval-based events for classification, In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, pp 393–404
Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M-C (2001) PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th international conference on data engineering. pp 215–224
Roddick J, Spiliopoulou M (2002) A survey of temporal knowledge discovery paradigms and methods. IEEE Trans Knowl Data Eng 4(14):750–767
Sacchi L, Larizza C, Combi C, Bellazi R (2007) Data mining with temporal abstractions: learning rules from time series. Data Min Knowl Discov 15:217–247
Shahar Y (1997) A framework for knowledge-based temporal abstraction. Artif Intell 90(1–2):79–133
Shahar Y (1999) Knowledge-based temporal interpolation. J Exp Theor Artif Intell 11:123–144
Villafane R, Hua K, Tran D, Maulik B (2000) Knowledge discovery from time series of interval events. J Intell Inf Syst 15(1):71–89
Winarko E, Roddick J (2007) Armada: an algorithm for discovering richer relative temporal association rules from interval-based data. Data Knowl Eng 1(63):76–90
Wu S, Chen Y (2007) Mining non ambiguous temporal patterns for interval-based events. IEEE Trans Knowl Data Eng 19(6):742–758
Acknowledgments
The authors wish to thank Panagiotis Papapetrou for sharing datasets and insightful discussions, as well as Christos Faloutsos, Christian Freksa, Frank Hoppner, Fabian Moerchen and Dhaval Patel for insightful discussions about time intervals mining. This work was supported in part by grants from the Deutsche Telekom Laboratories at Ben Gurion University, and by the HP labs Innovation Research Program, Award No. 2008-1023.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
Table 3 contains the cutoff definitions used for each state in the case of the raw measurements included in the Diabetes dataset. The rest of the raw data consisted of medications, for each of which an overall defined daily dose (DDD) abstraction was defined.
The knowledge-based state-abstraction definitions for the measurements were provided by physicians from Ben Gurion University’s Soroka Medical Center.
In the following four parts of Table 3, the cutoff definitions are presented for each state for the various temporal measurement variables in the Diabetes dataset.
Rights and permissions
About this article
Cite this article
Moskovitch, R., Shahar, Y. Fast time intervals mining using the transitivity of temporal relations. Knowl Inf Syst 42, 21–48 (2015). https://doi.org/10.1007/s10115-013-0707-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-013-0707-x