2 citations · 2 across the 8 of their papers we have counts for
8 papers
Efficient Learning-based Graph Simulation for Temporal Graphs
Sheng Xiang, Chenhao Xu, Dawei Cheng +2
Graph simulation has recently received a surge of attention in graph processing and analytics. In real-life applications, e.g. social science, biology, and chemistry, many graphs a…
DHG-Bench: A Comprehensive Benchmark for Deep Hypergraph Learning
Fan Li, Xiaoyang Wang, Wenjie Zhang +2
Deep graph models have achieved great success in network representation learning. However, their focus on pairwise relationships restricts their ability to learn pervasive higher-o…
Efficient Temporal Simple Path Graph Generation
Zhiyang Tang, Yanping Wu, Xiangjun Zai +3
Interactions between two entities often occur at specific timestamps, which can be modeled as a temporal graph. Exploring the relationships between vertices based on temporal paths…
Efficient Dynamic Attributed Graph Generation
Fan Li, Xiaoyang Wang, Dawei Cheng +3
Data generation is a fundamental research problem in data management due to its diverse use cases, ranging from testing database engines to data-specific applications. However, rea…
TCGU: Data-centric Graph Unlearning based on Transferable Condensation
Fan Li, Xiaoyang Wang, Dawei Cheng +3
With growing demands for data privacy and model robustness, graph unlearning (GU), which erases the influence of specific data on trained GNN models, has gained significant attenti…
Efficient Influence Minimization via Node Blocking
Jinghao Wang, Yanping Wu, Xiaoyang Wang +4
Given a graph G, a budget k and a misinformation seed set S, Influence Minimization (IMIN) via node blocking aims to find a set of k nodes to be blocked such that the expected spre…
Hypergraph Self-supervised Learning with Sampling-efficient Signals
Fan Li, Xiaoyang Wang, Dawei Cheng +3
Self-supervised learning (SSL) provides a promising alternative for representation learning on hypergraphs without costly labels. However, existing hypergraph SSL models are mostly…
Deep Overlapping Community Search via Subspace Embedding
Qing Sima, Jianke Yu, Xiaoyang Wang +3
Overlapping Community Search (OCS) identifies nodes that interact with multiple communities based on a specified query. Existing community search approaches fall into two categorie…