WCCS: Efficient Wedge Conductance Community Search over Large Temporal Bipartite Graphs (Full Paper)

📅 2026-09-15
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文提出WCCS方法,通过引入新的时间楔形传导度量和高效搜索框架,解决大规模时变二部图中社区搜索问题,确保社区内聚性和外部分离性。
📝 Abstract
Bipartite graphs are ubiquitous for modeling complex interactions between two distinct entity types across numerous practical applications such as e-commerce, academic networks, and social systems. Despite significant progress in community search over bipartite graphs, most prior work is limited to static settings and ignores the rich temporal dynamics present in real-world networks. Moreover, existing methods typically adopt edge-centric measures and strict consecutivity constraints, failing to capture higher-order interactions and frequent yet non-consecutive activities. More importantly, they often neglect the crucial community-quality requirements of both internal cohesiveness and external sparsity, failing to identify critical nodes or including many irrelevant nodes. To address these dilemmas, we propose the novel problem of \emph{Wedge Conductance Community Search (WCCS)}, which aims to identify a query-dependent community that is not only structurally and temporally cohesive but also well-separated from the rest of the network over non-consecutive timestamps. We formalize WCCS by generalizing the classical $(α,β)$-core to a higher-order $(α,β,τ)$-wedge core, and by proposing a novel temporal wedge conductance metric that explicitly balances internal density and external sparsity. To solve WCCS efficiently, we first develop an online priority-driven filter-and-expand framework with several effective pruning techniques and a powerful geometric slope optimization for rapid temporal wedge conductance calculation. Subsequently, to further improve scalability, we propose an offline compressed index to accelerate search. Finally, comprehensive experiments on seven real-world datasets demonstrate the effectiveness, efficiency, and scalability of our solutions compared to eight competitors.
Problem

Research questions and friction points this paper is trying to address.

bipartite graphs
temporal dynamics
community search
higher-order interactions
non-consecutive activities
Innovation

Methods, ideas, or system contributions that make the work stand out.

Wedge Conductance Community Search
temporal wedge conductance
non-consecutive timestamps
(α,β,τ)-wedge core
online priority-driven filter-and-expand framework
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
Longlong Lin
Longlong Lin
Southwest University
Graph Machine LearningGraph ClusteringSimilarity SearchLLM-based Graph Analysis
W
Wei Chen
College of Computer and Information Science, Southwest University
P
Pingpeng Yuan
Huazhong University of Science and Technology
R
Ruikun Luo
Huazhong University of Science and Technology
Qiangqiang Dai
Qiangqiang Dai
Beijing Institute of Technology
Graph Data Management
Rong-Hua Li
Rong-Hua Li
Beijing Institute of Technology
Algorithms for (big) graphmatrixand sequence data