Hi,

Are there differences between frequent subgraph mining in dynamic graphs and frequent subgraph mining in evolvin graphs and frequent subgraph mining in incremental graphs?
if you know, please let me know?

There are two different topics related to frequent subgraph mining: (1) mining frequent subgraphs (FSGs) in a single large graph and (2) mining FSGs in a set of graphs (i.e., a graph dataset).

Mining FSGs in a dynamic/evolving graph means mining FSGs in a single graph, where nodes/edges can be inserted/deleted.

Mining FSGs in an incremental graph dataset means mining FSGs in a graph dataset, where more graphs can be added to the dataset.

Hello Dang,

Thank you so much for your reply.

would you please provide me with the reference of your clarification.

Best Regards,
Maya

Hi Maya,

FYI
Mining FSGs in a dynamic single graph
1. Pattern Mining in Frequent Dynamic Subgraphs: http://ieeexplore.ieee.org/document/4053109/
2. Incremental Frequent Subgraph Mining on Large Evolving Graphs: http://ieeexplore.ieee.org/document/8014497/

Mining FSGs in an incremental graph dataset
1. GraphZip: Dictionary-based Compression for Mining Graph Streams: https://arxiv.org/pdf/1703.08614.pdf
2. TGP: Mining Top-K Frequent Closed Graph Pattern without Minimum Support: https://link.springer.com/content/pdf/10.1007%2F978-3-642-17316-5_51.pdf

Hope it helps.
Dang

Hi Dang,

Thank you so much for your help.

Regards,
Maya