PLACE: Prompt Learning for Attributed Community Search
Shuheng Fang, Kangfei Zhao, Rener Zhang, Yu Rong, Jeffrey Xu Yu

TL;DR
PLACE introduces a novel prompt learning framework for attributed community search in large graphs, leveraging prompt-tuning concepts from NLP to improve pattern detection and attribute similarity identification.
Contribution
It pioneers the integration of prompt-tuning into graph neural networks for community search, enhancing scalability and effectiveness on large-scale graphs.
Findings
PLACE outperforms state-of-the-art methods with 22% higher F1 scores.
The framework effectively handles million-scale graphs.
Prompt tokens improve structural and attribute pattern recognition.
Abstract
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Information Retrieval and Search Behavior · Graph Theory and Algorithms
