9 papers
Scalable Approximate Algorithm for Dynamic Densest Subhypergraphs with Solution-Guided Maintenance
Jingbang Chen, Chenhao Ma, Yingli Zhou
Hypergraphs model interactions involving groups of entities, and finding highly connected groups is a fundamental task in analyzing these data. When interactions arrive and expire,…
PreGress: Ranking-Native Pre-training and Prompting for Graph Node Ranking
Lujie Ban, Jiasheng shi, Yingli Zhou +5
Node ranking is a fundamental problem in graph information retrieval, measuring the relative importance of nodes and supporting a wide range of applications such as influence analy…
Generative Retrieval for Table Union Search
Shulun Zhang, Linting Wang, Yuwei Xu +2
Modern data lakes contain heterogeneous tables whose task-relevant information is often scattered across different schemas, sources, and naming conventions. Table union search (TUS…
EMA: Approximate Nearest Neighbor Search with General Attribute Filtering and Dynamic Updates
Mocheng Li, Baotong Lu, James Cheng +1
Filtering Approximate Nearest Neighbor (FANN) search is a critical and emerging task for strengthening the query capability of vector databases, supporting applications such as rec…
Scalable Algorithm for Dynamic Quasi-clique Detection
Jingbang Chen, Weinuo Li, Yingli Zhou +4
Identifying dense subgraphs known as quasi-cliques is pivotal in numerous graph mining tasks across domains such as social networks, biology, and e-commerce. While prior work has d…
Topology-Aware LLM-Driven Social Simulation: A Unified Framework for Efficient and Realistic Agent Dynamics
Yuwei Xu, Shulun Zhang, Yingli Zhou +3
Social simulation is essential for understanding collective human behavior by modeling how individual interactions give rise to large-scale social dynamics. Recent advances in larg…
Scalable Approximate Biclique Counting over Large Bipartite Graphs
Jingbang Chen, Weinuo Li, Yingli Zhou +5
Counting -bicliques in bipartite graphs is crucial for a variety of applications, from recommendation systems to cohesive subgraph analysis. Yet, it remains computationally…
Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index
Qiuyang Mang, Jingbang Chen, Hangrui Zhou +6
Bipartite graphs are ubiquitous in many domains, e.g., e-commerce platforms, social networks, and academia, by modeling interactions between distinct entity sets. Within these grap…
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
Jingbang Chen, Qiuyang Mang, Hangrui Zhou +3
Signed networks, characterized by edges labeled as either positive or negative, offer nuanced insights into interaction dynamics beyond the capabilities of unsigned graphs. Central…