Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse




Conference Paper

Pattern Mining in Frequent Dynamic Subgraphs


Borgwardt,  KM
Max Planck Institute for Biological Cybernetics, Max Planck Society;

There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available

Borgwardt, K., Kriegel, H.-P., & Wackersreuther, P. (2006). Pattern Mining in Frequent Dynamic Subgraphs. In Sixth International Conference on Data Mining (ICDM 2006) (pp. 818-822). Los Alamitos, CA, USA: IEEE Computer Society.

Cite as:
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowledge. While current data mining deals with static graphs that do not change over time, coming years will see the advent of an increasing number of time series of graphs. In this article, we investigate how pattern mining on static graphs can be extended to time series of graphs. In particular, we are considering dynamic graphs with edge insertions and edge deletions over time. We define frequency in this setting and provide algorithmic solutions for finding frequent dynamic subgraph patterns. Existing subgraph mining algorithms can be easily integrated into our framework to make them handle dynamic graphs. Experimental results on real-world data confirm the practical feasibility of our approach.