Finding Frequent Patterns in Parallel Point Processes

  • Christian Borgelt
  • David Picado-Muiño
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8207)


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.


Event Type Spike Train Frequent Pattern Minimum Support Threshold Synchronous Event 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bhandari, R., Negi, S., Solzbacher, F.: Wafer Scale Fabrication of Penetrating Neural Electrode Arrays. Biomedical Microdevices 12(5), 797–807 (2010)CrossRefGoogle Scholar
  2. 2.
    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.1074Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Hebb, D.: The Organization of Behavior. J. Wiley & Sons, New York (1949)Google Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Picado-Muiño, D., Castro-León, I., Borgelt, C.: Fuzzy Characterization of Spike Synchrony in Parallel Spike Trains. Soft Computing (to appear, 2013)Google Scholar
  9. 9.
    Picado-Muino, D., Borgelt, C.: Frequent Itemset Mining for Sequential Data: Synchrony in Neuronal Spike Trains. Intelligent Data Analysis (to appear, 2013)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Christian Borgelt
    • 1
  • David Picado-Muiño
    • 1
  1. 1.European Centre for Soft ComputingMieresSpain

Personalised recommendations