activity
20232026
most citedProbDiffFlow: An Efficient Learning-Free Framework for Probabilistic Single-Image Optical Flow Estimation

1 citations · 2 across the 27 of their papers we have counts for

collaborators
Showing 2024Show all

10 papers · 1 filter

cs.DB2024

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…

cs.DS2024

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges

Lingkai Meng, Long Yuan, Xuemin Lin +3

Bipartite graphs are commonly used to model relationships between two distinct entities in real-world applications, such as user-product interactions, user-movie ratings and collab…

cs.LG2024

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…

cs.DB2024

Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs

Yanping Wu, Renjie Sun, Xiaoyang Wang +4

Cohesive subgraph mining is a fundamental problem in bipartite graph analysis. In reality, relationships between two types of entities often occur at some specific timestamps, whic…

cs.DB2024

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…

cs.LG2024

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…

cs.SI2024

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…

cs.SI2024

Efficient Unsupervised Community Search with Pre-trained Graph Transformer

Jianwei Wang, Kai Wang, Xuemin Lin +2

Community search has aroused widespread interest in the past decades. Among existing solutions, the learning-based models exhibit outstanding performance in terms of accuracy by le…

cs.SI2024

Neural Attributed Community Search at Billion Scale

Jianwei Wang, Kai Wang, Xuemin Lin +2

Community search has been extensively studied in the past decades. In recent years, there is a growing interest in attributed community search that aims to identify a community bas…

cs.DB2024

Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs

Long Yuan, Kongzhang Hao, Xuemin Lin +1

Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing perform…