Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs.
Jintang LiSheng TianRuofan WuLiang ZhuWelong ZhaoChanghua MengLiang ChenZibin ZhengHongzhi YinPublished in: CoRR (2023)
Keyphrases
- dynamic graph
- dynamic networks
- graph theory
- graph representation
- graph matching
- directed graph
- graph databases
- graph structure
- adjacency matrix
- graph construction
- graph theoretic
- weighted graph
- graph search
- massive graphs
- graph classification
- graph mining
- bipartite graph
- spanning tree
- undirected graph
- graph partitioning
- graph model
- graph data
- graph theoretical
- graph clustering
- subgraph isomorphism
- maximum cardinality
- semi supervised
- series parallel
- labeled graphs
- graph structures
- graph kernels
- random graphs
- graph transformation
- minimum spanning tree
- search space
- inexact graph matching
- reachability queries
- graph representations
- attributed graphs
- web graph
- structured data
- association graph
- graph properties
- graph isomorphism
- graph embedding
- graph drawing
- connected components
- proximity graph
- random walk
- social networks
- maximum common subgraph
- connected dominating set