Frequent subgraph discovery in dynamic networks
| Autor: | Annahita Oswald, Christian Bohm, Karsten M. Borgwardt, Peter Wackersreuther, Bianca Wackersreuther |
|---|---|
| Rok vydání: | 2010 |
| Předmět: | |
| Zdroj: | MLG@KDD MLG '10: Proceedings of the Eighth Workshop on Mining and Learning with Graphs |
| DOI: | 10.1145/1830252.1830272 |
| Popis: | In many application domains, graphs are utilized to model entities and their relationships, and graph mining is important to detect patterns within these relationships. While the majority of recent data mining techniques deal with static graphs that do not change over time, recent years have witnessed the advent of an increasing number of time series of graphs. In this paper, we define a novel framework to perform frequent subgraph discovery in dynamic networks. In particular, we are considering dynamic graphs with edge insertions and edge deletions over time. Existing subgraph mining algorithms can be easily integrated into our framework to make them handle dynamic graphs. Finally, an extensive experimental evaluation on a large real-world case study confirms the practical feasibility of our approach. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|