Graph-Based Data Mining in Dynamic Networks: Empirical Comparison of Compression-Based and Frequency-Based Subgraph Mining

摘要: We propose a dynamic graph-based relational mining approach using graph-rewriting rules to learns patterns in networks that structurally change over time. A graph containing sequence of graphs time represents properties as well structural the network. Our discovers rules, which describe transformations between two sequential time, and also description generalize discovered rules. The show how temporal changes. apply our biological understand biosystems compression-based discovery is compared with frequent subgraph several evaluation metrics.