Abstract
In several application domains, such as sign language, medicine, and sensor networks, events are not necessarily instantaneous but they can have a time duration. Sequences of interval-based events may contain useful domain knowledge; thus, searching, indexing, and mining such sequences is crucial. We introduce two distance measures for comparing sequences of interval-based events which can be used for several data mining tasks such as classification and clustering. The first measure maps each sequence of interval-based events to a set of vectors that hold information about all concurrent events. These sets are then compared using an existing dynamic programming method. The second method, called Artemis, finds correspondence between intervals by mapping the two sequences into a bipartite graph. Similarity is inferred by employing the Hungarian algorithm. In addition, we present a linear-time lower-bound for Artemis. The performance of both measures is tested on data from three domains: sign language, medicine, and sensor networks. Experiments show the superiority of Artemis in terms of robustness to high levels of artificially introduced noise.
Chapter PDF
Similar content being viewed by others
References
Abraham, T., Roddick, J.F.: Incremental meta-mining from large temporal data sets. In: Proceedings of the Workshops on Data Warehousing and Data Mining, pp. 41–54 (1999)
Ale, J.M., Rossi, G.H.: An approach to discovering temporal association rules. In: Proc. of the SAC, pp. 294–300 (2000)
Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the ACM 26(11), 832–843 (1983)
Berendt, B.: Explaining preferred mental models in Allen inferences with a metrical model of imagery. In: Proceedings of the Annual Conference of the Cognitive Science Society, pp. 489–494 (1996)
Bergen, B., Chang, N.: Embodied construction grammar in simulation-based language understanding. In: Construction grammars: Cognitive grounding and theoretical extensions, pp. 147–190 (2005)
Chen, X., Petrounias, I.: Mining temporal features in association rules. In: Żytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol. 1704, pp. 295–300. Springer, Heidelberg (1999)
Giannotti, F., Nanni, M., Pedreschi, D.: Efficient mining of temporally annotated sequences. In: SDM, vol. 6, pp. 346–357 (2006)
Höppner, F.: Discovery of temporal patterns. In: Siebes, A., De Raedt, L. (eds.) PKDD 2001. LNCS (LNAI), vol. 2168, pp. 192–203. Springer, Heidelberg (2001)
Höppner, F., Klawonn, F.: Finding informative rules in interval sequences. In: Hoffmann, F., Adams, N., Fisher, D., Guimarães, G., Hand, D.J. (eds.) IDA 2001. LNCS, vol. 2189, pp. 123–132. Springer, Heidelberg (2001)
Hwang, S.-Y., Wei, C.-P., Yang, W.-S.: Discovery of temporal patterns from process instances. Computers in Industry 53(3), 345–364 (2004)
Kam, P., Fu, A.W.: Discovering temporal patterns for interval-based events. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol. 1874, pp. 317–326. Springer, Heidelberg (2000)
Kosara, R., Miksch, S.: Visualizing complex notions of time. Studies in Health Technology and Informatics, 211–215 (2001)
Kostakis, O., Papapetrou, P., Hollmén, J.: Distance measure for querying arrangements of temporal intervals. In: Proc. of ACM Pervasive Technologies Related to Assistive Environments, PETRA (2011)
Kruskal, J.B., Liberman, M.: The symmetric time warping algorithm: From continuous to discrete. In: Time Warps. Addison-Wesley, Reading (1983)
Laxman, S., Sastry, P., Unnikrishnan, K.: Discovering frequent generalized episodes when events persist for different durations. IEEE Transactions on Knowledge and Data Engineering 19(9), 1188–1201 (2007)
Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics 10(8), 707–710 (1966)
Lin, J.-L.: Mining maximal frequent intervals. In: Proc. of SAC, pp. 624–629 (2003)
Lu, H., Han, J., Feng, L.: Stock movement prediction and n-dimensional inter-transaction association rules. In: Proc. of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 12:1–12:7 (1998)
Mooney, C., Roddick, J.F.: Mining relationships between interacting episodes. In: Proc. of SDM (2004)
Mörchen, F.: Unsupervised pattern mining from symbolic temporal data. SIGKDD Explor. Newsl. 9, 41–55 (2007)
Mörchen, F.: Temporal pattern mining in symbolic time point and time interval data. In: Proc. of ACM SIGKDD (2010)
Mörchen, F., Fradkin, D.: Robust mining of time intervals with semi-interval partial order patterns. In: SDM, pp. 315–326 (2010)
Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics 5(1), 32–38 (1957)
Pachet, F., Ramalho, G., Carrive, J.: Representing temporal musical objects and reasoning in the MusES system. Journal of new music research 25(3), 252–275 (1996)
Papapetrou, P., Benson, G., Kollios, G.: Discovering frequent poly-regions in dna sequences. In: Proc. of the IEEE ICDM Workshop on Data Mining in Bioinformatics, pp. 94–98 (2006)
Papapetrou, P., Kollios, G., Sclaroff, S., Gunopulos, D.: Discovering frequent arrangements of temporal intervals. In: Proc. of IEEE ICDM, pp. 354–361 (2005)
Papapetrou, P., Kollios, G., Sclaroff, S., Gunopulos, D.: Mining frequent arrangements of temporal intervals. In: Knowledge and Information Systems (KAIS), vol. 21, pp. 133–171 (2009)
Patel, D., Hsu, W., Lee, M.: Mining relationships among interval-based events for classification. In: Proc. of ACM SIGMOD, pp. 393–404 (2008)
Pissinou, N., Radev, I., Makki, K.: Spatio-temporal modeling in video and multimedia geographic information systems. GeoInformatica 5(4), 375–409 (2001)
Villafane, R., Hua, K.A., Tran, D., Maulik, B.: Knowledge discovery from series of interval events. Intelligent Information Systems 15(1), 71–89 (2000)
Vlachos, M., Hadjieleftheriou, M., Gunopulos, D., Keogh, E.: Indexing multidimensional time-series. The VLDB Journal 15, 1–20 (2006)
Winarko, E., Roddick, J.F.: Armada - an algorithm for discovering richer relative temporal association rules from interval-based data. Data & Knowledge Engineering 63(1), 76–90 (2007)
Wu, S.-Y., Chen, Y.-L.: Mining nonambiguous temporal patterns for interval-based events. IEEE Transactions on Knowledge and Data Engineering 19(6), 742–758 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kostakis, O., Papapetrou, P., Hollmén, J. (2011). ARTEMIS: Assessing the Similarity of Event-Interval Sequences. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2011. Lecture Notes in Computer Science(), vol 6912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23783-6_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-23783-6_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23782-9
Online ISBN: 978-3-642-23783-6
eBook Packages: Computer ScienceComputer Science (R0)