Yifeng Lu
Marwan Hassani
Thomas Seidl
ABSTRACT
This paper address the problem of temporal pattern mining from multiple data streams containing temporal events. Temporal events are considered as real world events aligned with comprehensive starting and ending timing information rather than simple integer timestamps. Predefined relations, such as "before" and "after", describe the heterogeneous relationships hidden in temporal data with limited diversity. In this work, the relationships among events are learned dynamically from the temporal information. Each event is treated as an object with a label and numerical attributes. An online-offline model is used as the primary structure for analyzing the evolving multiple streams. Different distance functions on temporal events and sequences can be applied depending on the application scenario. A prefix tree is introduced for a fast incremental pattern update.
Events in the real world usually persist for some period. It is more natural to model events as intervals with temporal information rather than as points on the timeline. Based on the representation proposed in this work, our approach can also be extended to handle interval data. Experiments show how the method, with richer information and more accurate results than the state-of-the-art, processes both point-based and interval-based event streams efficiently.
- Rakesh Agrawal and Ramakrishnan Srikant. 1995. Mining sequential patterns. In ICDE. IEEE, 3--14. Google Scholar
Digital Library
- James F Allen. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26, 11 (1983), 832--843. Google ScholarDigital Library
- Feng Cao, Martin Ester, Weining Qian, and Aoying Zhou. 2006. Density-Based Clustering over an Evolving Data Stream with Noise. In SDM. SIAM, 328--339.Google Scholar
- Chung-i Chang and Nancy P Lin. 2009. Sequential Patterns Mining with Fuzzy Time-Intervals. ICSAI (2009), 165--169.Google Scholar
- Lei Chang, Tengjiao Wang, Dongqing Yang, and Hua Luan. 2008. Seqstream: Mining closed sequential patterns over stream sliding windows. (2008), 83--92. Google ScholarDigital Library
- Gong Chen, Xindong Wu, and Xingquan Zhu. 2005. Sequential pattern mining in multiple streams. In ICDM'05. IEEE, 585--588. Google ScholarDigital Library
- Kuan-Ying Chen, Bijay Prasad Jaysawal, Jen-Wei Huang, and Yong-Bin Wu. 2014. Mining frequent Time Interval-based Event with duration patterns from temporal database. In DSAA. IEEE, 548--554.Google Scholar
- Yen-Liang Chen and Tony Cheng-Kui Huang. 2005. Discovering fuzzy time-interval sequential patterns in sequence databases. IEEE Trans. Systems, Man, and Cybernetics, Part B 35, 5 (2005), 959--972. Google ScholarDigital Library
- Yi-Cheng Chen, Wen-Chih Peng, and Suh-Yin Lee. 2015. Mining Temporal Patterns in Time Interval-based Data. TKDE 27, 12 (2015), 3318--3331. Google ScholarDigital Library
- Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise.. In Kdd, Vol. 96. 226--231. Google ScholarDigital Library
- Fosca Giannotti, Mirco Nanni, and Dino Pedreschi. 2006. Efficient Mining of Temporally Annotated Sequences.. In SDM. SIAM, 348--359.Google Scholar
- Thomas Guyet and René Quiniou. 2008. Mining temporal patterns with quantitative intervals. In IEEE ICDM Workshops. IEEE, 218--227. Google ScholarDigital Library
- Thomas Guyet and René Quiniou. 2011. Extracting temporal patterns from interval-based sequences. In IJCAI, Vol. 22. 1306. Google ScholarDigital Library
- Thomas Guyet and René Quiniou. 2012. Incremental mining of frequent sequences from a window sliding over a stream of itemsets. Atelier CIDN Classification Incrémentale et Détection de Nouveauté (2012).Google Scholar
- Marwan Hassani. 2015. Efficient Clustering of Big Data Streams. Ph.D. Dissertation. RWTH Aachen University.Google Scholar
- Marwan Hassani, Christian Beecks, Daniel Töws, Tatiana Serbina, Max Haberstroh, Paula Niemietz, Sabina Jeschke, Stella Neumann, and Thomas Seidl. 2015. Sequential Pattern Mining of Multimodal Streams in the Humanities. In BTW. 683--686.Google Scholar
- Marwan Hassani, Philipp Kranen, Rajveer Saini, and Thomas Seidl. 2014. Subspace anytime stream clustering. In SSDBM. 37. Google ScholarDigital Library
- Marwan Hassani and Thomas Seidl. 2011. Towards a mobile health context prediction: Sequential pattern mining in multiple streams. In 2011 IEEE 12th MDM, Vol. 2. IEEE, 55--57. Google ScholarDigital Library
- Marwan Hassani, Sergio Siccha, Florian Richter, and Thomas Seidl. 2015. Efficient Process Discovery From Event Streams Using Sequential Pattern Mining. In SSCI. IEEE, 1366--1373.Google Scholar
- Marwan Hassani, Pascal Spaus, Alfredo Cuzzocrea, and Thomas Seidl. 2015. Adaptive Stream Clustering Using Incremental Graph Maintenance. In BigMine 2015 at KDD'15. 49--64. Google ScholarDigital Library
- Yu Hirate and Hayato Yamana. 2006. Generalized sequential pattern mining with item intervals. Journal of Computers 1, 3 (2006), 51--60.Google ScholarCross Ref
- Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, and Suh-Yin Lee. 2006. Incremental mining of sequential patterns over a stream sliding window. In Sixth IEEE ICDM Workshops. IEEE, 677--681. Google ScholarDigital Library
- J Zico Kolter and Matthew J Johnson. 2011. REDD: A public data set for energy disaggregation research. Citeseer.Google Scholar
- Alexios Kotsifakos, Panagiotis Papapetrou, and Vassilis Athitsos. 2013. IBSM: Interval-based sequence matching. In SDM. SIAM, 596--604.Google Scholar
- Luiz F Mendes, Bolin Ding, and Jiawei Han. 2008. Stream sequential pattern mining with precise error bounds. In ICDM. IEEE, 941--946. Google ScholarDigital Library
- Fumiya Nakagaito, Tomonobu Ozaki, and Takenao Ohkawa. 2009. Discovery of Quantitative Sequential Patterns from Event Sequences. In Proceedings of the 2009 IEEE ICDM Workshops. IEEE Computer Society, 31--36. Google ScholarDigital Library
- Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Mei-Chun Hsu. 2001. Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE. IEEE, 215--224. Google ScholarDigital Library
- Alfred J Reich. 1994. Intervals, Points, and Branching Time.. In TIME. 121--133.Google Scholar
- Shin-Yi Wu and Yen-Liang Chen. 2007. Mining nonambiguous temporal patterns for interval-based events. KAIS 19, 6 (2007), 742--758. Google ScholarDigital Library
- Mariko Yoshida, Tetsuya Iizuka, Hisako Shiohara, and Masanori Ishiguro. 2000. Mining sequential patterns including time intervals. SPIE 4057 (2000), 213--220.Google Scholar
Index Terms
- Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering
Recommendations
Self-Adaptive Anytime Stream Clustering
ICDM '09: Proceedings of the 2009 Ninth IEEE International Conference on Data MiningClustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited. Clustering has to be performed in a single pass over the incoming data ...
Batch-Free Event Sequence Pattern Mining for Communication Stream Data with Instant and Persistent Events
Communication systems consist of many subsystems and components among which various stream data including control messages as well as payload messages are transferred. Some messages can be regarded as events which are identifiable occurrence that has ...
Mining frequent arrangements of temporal intervals
The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal arrangements of event ...
Comments