Abstract
We consider the task of finding frequent patterns in parallel point processes—also known as finding frequent parallel episodes in event sequences. This task can be seen as a generalization of frequent item set mining: the co-occurrence of items (or events) in transactions is replaced by their (imprecise) co-occurrence on a continuous (time) scale, meaning that they occur in a limited (time) span from each other. We define the support of an item set in this setting based on a maximum independent set approach allowing for efficient computation. Furthermore, we show how the enumeration and test of candidate sets can be made efficient by properly reducing the event sequences and exploiting perfect extension pruning. Finally, we study how the resulting frequent item sets/patterns can be filtered for closed and maximal sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhandari, R., Negi, S., Solzbacher, F.: Wafer Scale Fabrication of Penetrating Neural Electrode Arrays. Biomedical Microdevices 12(5), 797–807 (2010)
Borgelt, C.: Frequent Item Set Mining. In: Wiley Interdisciplinary Reviews (WIREs): Data Mining and Knowledge Discovery, vol. 2, pp. 437–456. J. Wiley & Sons, Chichester (2012), doi:10.1002/widm.1074
Fiedler, M., Borgelt, C.: Subgraph Support in a Single Graph. In: Proc. IEEE Int. Workshop on Mining Graphs and Complex Data, pp. 399–404. IEEE Press, Piscataway (2007)
Grahne, G., Zhu, J.: Efficiently Using Prefix-trees in Mining Frequent Itemsets. In: Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003), Aachen, Germany. CEUR Workshop Proceedings, vol. 90 (2003)
Hebb, D.: The Organization of Behavior. J. Wiley & Sons, New York (1949)
Laxman, S., Sastry, P.S., Unnikrishnan, K.: Discovering Frequent Episodes and Learning Hidden Markov Models: A Formal Connection. IEEE Trans. on Knowledge and Data Engineering 17(11), 1505–1517 (2005)
Mannila, H., Toivonen, H., Verkamo, A.: Discovery of Frequent Episodes in Event Sequences. In: Data Mining and Knowledge Discovery, vol. 1(3), pp. 259–289 (1997)
Picado-Muiño, D., Castro-León, I., Borgelt, C.: Fuzzy Characterization of Spike Synchrony in Parallel Spike Trains. Soft Computing (to appear, 2013)
Picado-Muino, D., Borgelt, C.: Frequent Itemset Mining for Sequential Data: Synchrony in Neuronal Spike Trains. Intelligent Data Analysis (to appear, 2013)
Vanetik, N., Gudes, E., Shimony, S.E.: Computing Frequent Graph Patterns from Semistructured Data. In: Proc. IEEE Int. Conf. on Data Mining, pp. 458–465. IEEE Press, Piscataway (2002)
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proc. 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 283–296. AAAI Press, Menlo Park (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borgelt, C., Picado-Muiño, D. (2013). Finding Frequent Patterns in Parallel Point Processes. In: Tucker, A., Höppner, F., Siebes, A., Swift, S. (eds) Advances in Intelligent Data Analysis XII. IDA 2013. Lecture Notes in Computer Science, vol 8207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41398-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-41398-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41397-1
Online ISBN: 978-3-642-41398-8
eBook Packages: Computer ScienceComputer Science (R0)