Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Pattern Mining in Frequent Dynamic Subgraphs

There are no MPG-Authors in the publication available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
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'06) (pp. 818-822). Los Alamitos, CA, USA: IEEE Computer Society.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-CF4D-3
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.