The Community for Technology Leaders
2018 IEEE 34th International Conference on Data Engineering (ICDE) (2018)
Paris, France
Apr 16, 2018 to Apr 19, 2018
ISSN: 2375-026X
ISBN: 978-1-5386-5520-7
pp: 1767-1768
ABSTRACT
Frequent subgraph mining is a core graph operation used in many domains. Most existing techniques target static graphs. However, modern applications utilize large evolving graphs. Mining these graphs using existing techniques is infeasible because of the high computational cost. We propose IncGM+, a fast incremental approach for frequent subgraph mining on large evolving graphs. We adapt the notion of "fringe" to the graph context, that is, the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost efficiency, IncGM+ stores a number of selected embeddings to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Our results confirm that IncGM+ outperforms existing methods, scales to larger graphs and consumes less memory.
INDEX TERMS
data mining, graph theory
CITATION

E. Abdelhamid, M. Canim, M. Sadoghi, B. Bhattacharjee, Y. Chang and P. Kalnis, "Incremental Frequent Subgraph Mining on Large Evolving Graphs," 2018 IEEE 34th International Conference on Data Engineering (ICDE), Paris, France, 2018, pp. 1767-1768.
doi:10.1109/ICDE.2018.00241
89 ms
(Ver 3.3 (11022016))