5 papers
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…
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…
TRACE: Intra-visit Clinical Event Nowcasting via Effective Patient Trajectory Encoding
Yuyang Liang, Yankai Chen, Yixiang Fang +2
Electronic Health Records (EHR) have become a valuable resource for a wide range of predictive tasks in healthcare. However, existing approaches have largely focused on inter-visit…
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
Yingli Zhou, Qingshuo Guo, Yi Yang +3
As a fundamental topic in graph mining, Densest Subgraph Discovery (DSD) has found a wide spectrum of real applications. Several DSD algorithms, including exact and approximation a…
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…