Scalable Community Search over Large-scale Graphs based on Graph Transformer

Given a graph G and a query node q, community search (CS) aims to find a structurally cohesive subgraph from G that contains q CS is widely used in many real-world applications, such as online recommendation and expert finding. Recently, the rise of learning-based CS methods has garnered extensive research interests, showcasing the promising potential of neural solutions. However, there remains room for optimization: (1) They initialize node features via classical methods, e.g., one-hot, random, and position encoding, which may fall short in capturing valuable community cohesiveness-related features. (2) The reliance on GCN or GCN-like models poses challenges in scaling to large graphs. (3) Existing methods do not adapt well to dynamic graphs, often requiring retraining from scratch. To handle this, we present CSFormer, a scalable CS based on Graph Transformer. First, we present a novel l -hop neighborhood community vector based on n-order h-index to represent each node's community features, generating a sequence of feature vectors by varying the neighborhood scope l Then, we build a Transformer backbone to learn a good graph embedding that carries rich community features, based on which we perform a prediction-filteringbased online CS to efficiently return a community of q We extend CSFormer to dynamic graphs and various community models. Extensive experiments on seven real-world graphs showour solution's superiority on effectiveness, e.g., we attain an average improvement of 20.6% in F1-score compared to the latest competitors.