EUVIMEDEUVIMED entdecken
Crossref

Graph Prompt Clustering

Man-Sheng Chen, Lai Pei-Yuan, Liao De-Zhang, Chang-Dong Wang, Jian-Huang Lai

IEEE Transactions on Pattern Analysis and Machine Intelligence · 2025-07 · 47 (7) · 5794-5805

DOI: 10.1109/tpami.2025.3553129 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Pattern Analysis and Machine Intelligence, 2025-07. Verfasst von Man-Sheng Chen und 4 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Open Project Program of Guangxi Key Laboratory of Digital Infrastructure.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Due to the wide existence of unlabeled graph-structured data (e.g., molecular structures), the graph-level clustering has recently attracted increasing attention, whose goal is to divide the input graphs into several disjoint groups. However, the existing methods habitually focus on learning the graphs embeddings with different graph reguralizations, and seldom refer to the obvious differences in data distributions of distinct graph-level datasets. How to characteristically consider multiple graph-level datasets in a general well-designed model without prior knowledge is still challenging. In view of this, we propose a novel Graph Prompt Clustering (GPC) method. Within this model, there are two main modules, i.e., graph model pretraining as well as prompt and finetuning. In the graph model pretraining module, the graph model is pretrained by a selected source graph-level dataset with mutual information maximization and self-supervised clustering regularization. In the prompt and finetuning module, the network parameters of the pretrained graph model are frozen, and a groups of learnable prompt vectors assigned to each graph-level representation are trained for adapting different target graph-level datasets with various data distributions. Experimental results across six benchmark datasets demonstrate the impressive generalization capability and effectiveness of GPC compared with the state-of-the-art methods.

Förderung

  • National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • Open Project Program of Guangxi Key Laboratory of Digital Infrastructure
  • Basic and Applied Basic Research Foundation of Guangdong Province

Zitieren

APA

Chen, M. S., Pei-Yuan, L., De-Zhang, L., Wang, C. D., & Lai, J. H. (2025). Graph Prompt Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence, 47(7), 5794-5805. https://doi.org/10.1109/tpami.2025.3553129

Vancouver

Chen MS, Pei-Yuan L, De-Zhang L, Wang CD, Lai JH. Graph Prompt Clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2025;47(7):5794-5805. doi:10.1109/tpami.2025.3553129

BibTeX
@article{Chen2025,
  author = {Chen, Man-Sheng and Pei-Yuan, Lai and De-Zhang, Liao and Wang, Chang-Dong and Lai, Jian-Huang},
  title = {Graph Prompt Clustering},
  journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year = {2025},
  volume = {47},
  number = {7},
  pages = {5794--5805},
  doi = {10.1109/tpami.2025.3553129}
}
Kostenlos starten →