PLACE: Prompt Learning for Attributed Community Search in Large Graphs

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Fang, Shuheng, Zhao, Kangfei, Zhang, Rener, Rong, Yu, Yu, Jeffrey Xu
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866918517071151104
author Fang, Shuheng
Zhao, Kangfei
Zhang, Rener
Rong, Yu
Yu, Jeffrey Xu
author_facet Fang, Shuheng
Zhao, Kangfei
Zhang, Rener
Rong, Yu
Yu, Jeffrey Xu
contents 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 22% compared to the state-of-the-arts on average.
format Preprint
id arxiv_https___arxiv_org_abs_2507_05311
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle PLACE: Prompt Learning for Attributed Community Search in Large Graphs
Fang, Shuheng
Zhao, Kangfei
Zhang, Rener
Rong, Yu
Yu, Jeffrey Xu
Information Retrieval
Artificial Intelligence
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 22% compared to the state-of-the-arts on average.
title PLACE: Prompt Learning for Attributed Community Search in Large Graphs
topic Information Retrieval
Artificial Intelligence
url https://arxiv.org/abs/2507.05311