Incremental Frequent Subgraph Mining on Large Evolving Graphs

Ehab Abdelhamid, Mustafa Canim, Mohammad Sadoghi, Bishwaranjan Bhatta, Yuan-Chi Chang, Panos Kalnis

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. 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 the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.
Original languageEnglish (US)
Pages (from-to)2710-2723
Number of pages14
JournalIEEE Transactions on Knowledge and Data Engineering
Volume29
Issue number12
DOIs
StatePublished - Aug 22 2017

Fingerprint

Dive into the research topics of 'Incremental Frequent Subgraph Mining on Large Evolving Graphs'. Together they form a unique fingerprint.

Cite this