Fast Effective Clustering Technologies for Highly Dynamic Massive Networks

BOTBIN: Accelerated Indexing for Structural Graph Clustering on Dynamic Graphs

F Zhang, Q Guo, J Gan, S Wang

2026-01-01

Graph clustering is a fundamental data mining task that clusters vertices into different groups. The structural graph clustering a..

Intrinsic and Extrinsic Factor Disentanglement for Recommendation in Various Context Scenarios

Y Su, W Jiang, F Lin, C Yang, SM Erfani, J Gan, Y Zhao, R Li, R Zhang

2025-05-09

In recommender systems, the patterns of user behaviors (e.g., purchase, click) may vary greatly in different contexts (e.g., time ..

Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters

Z Zhao, J Gan, B Ruan, Z Bao, J Qi, S Wang

2025-01-01

We study structural clustering on graphs in dynamic scenarios, where graphs can be updated by arbitrary insertions or deletions of..

Efficient Bitruss Decomposition without Butterfly Enumeration

F Lin, B Ruan, J Gan, L Li

2025-01-01

Mining cohesive subgraphs in bipartite graphs is of great importance to various real-world applications such as recommendation in ..

Efficient Example-Guided Interactive Graph Search

Z Zhao, J Gan, J Qi, Z Bao

2024-01-01

We study the problem of interactive graph search (IGS). Given a query entity f, the goal is to identify the target concept in a di..