PLACE: Prompt Learning for Attributed Community Search in Large Graphs
Shuheng Fang, Kangfei Zhao, Rener Zhang, Yu Rong, Jeffrey Xu Yu
摘要
Attributed Community Search (ACS) aims to identify communities in an attributed graph with structural cohesiveness and attribute homogeneity for given queries. While algorithmic approaches often suffer from structural inflexibility and attribute irrelevance, recent years have witnessed a broom in learning-based approaches that employ Graph Neural Networks (GNNs) to simultaneously model structural and attribute information. To improve GNN efficacy and efficiency, these approaches adopt various techniques to refine the input graph and queries, including query-dependent node pruning and feature enhancement. However, these refinements are either detached from the end-to-end optimization with the backbone model, or impose additional burdens on training resources, limiting their adaptability and practical usage in diverse graphs.
In this paper, we propose PLACE (Prompt Learning for Attributed Community Search), an innovative graph prompt learning framework for ACS. Enlightened by prompt-tuning in Natural Language Processing (NLP), where learnable prompt tokens are inserted to contextualize NLP queries, PLACE integrates structural and learnable prompt tokens into the graph as a query-dependent refinement mechanism, forming a prompt-augmented graph. Within this prompt-augmented graph structure, the learned prompt tokens serve as a bridge that strengthens connections between graph nodes for the query, enabling the GNN to more effectively identify patterns of structural cohesiveness and attribute similarity related to the specific query. We employ an alternating training paradigm to optimize both the prompt parameters and the GNN jointly. Moreover, we design a divide-and-conquer strategy to enhance scalability, supporting the model to handle million-scale graphs. Extensive experiments on 9 real-world graphs demonstrate the effectiveness of PLACE for three types of ACS queries, where PLACE achieves higher F1 scores by 14% compared to the state-of-the-arts on average.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper21
- Geom-GCN: Geometric Graph Convolutional NetworksHongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei 等ICLR 2020 · 被引用 1,445 次
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan 等ICLR 2020 · 被引用 1,155 次
- GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural NetworksZemin Liu, Xingtong Yu, Yuan Fang, Xinming ZhangWWW 2023 · 被引用 263 次
- All in One: Multi-Task Prompting for Graph Neural NetworksXiangguo Sun, Hong Cheng, Jia Li, Bo Liu 等KDD 2023 · 被引用 149 次
- GPPT: Graph Pre-training and Prompt Tuning to Generalize Graph Neural NetworksMingchen Sun, Kaixiong Zhou, Xin He, Ying Wang 等KDD 2022 · 被引用 141 次
相关 Paper
- Inductive Attributed Community Search: to Learn Communities across GraphsShuheng Fang, Kangfei Zhao, Yu Rong, Zhixun Li 等VLDB 2024 · 被引用 10 次
- Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive AttributedYuli Jiang, Yu Rong, Hong Cheng, Xin Huang 等VLDB 2022 · 被引用 58 次
- Prompt-Guided Community Search Under Extreme Few-Shot SupervisionWenxin Yang, Kaiyu Feng, Lanting Fang, Kangfei Zhao 等ICDE 2026
- Cohesiveness-aware Hierarchical Compressed Index for Community Search on Attributed GraphsYuxiang Wang, Zhangyang Peng, Xiangyu Ke, Xiaoliang Xu 等SIGMOD 2025 · 被引用 2 次
- Self-Training GNN-based Community Search in Large Attributed Heterogeneous Information NetworksYuan Li, Xiuxu Chen, Yuhai Zhao, Wen Shan 等ICDE 2024 · 被引用 14 次
