返回
Incremental Frequent Subgraph Mining on Large Evolving Graphs
DOI:10.1109/TKDE.2017.2743075.png)
摘要
En 中文
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 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.
Keyword:
Graph algorithms
data mining
indexing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Ultrastructural Microvascular Response to Boron Neutron Capture Therapy in an Experimental Model
Neurosurgery
IF0
Mineralogy and crystal chemistry of Mn, Fe, Co, Ni, and Cu in a deep-sea Pacific polymetallic nodule
A Statistical Physics Perspective to Understand Social Visual Attention in Autism Spectrum Disorder
Perception
IF0
A sliding window based algorithm for frequent closed itemset mining over data streams一种基于滑动窗口的数据流频繁闭项集挖掘算法

