Aug 2026· ACM Transactions on Information Systems· Vol 44, pp. 1 - 25· 0 citations· 51 references
TL;DR
This work is among the first to introduce and exploit the idea of prompt learning to align HIN features and textual features, and is composed of a text encoder and a graph encoder and uses contrastive learning to align and fuse the graph–text pair.
Abstract
Heterogeneous information networks (HINs) play an indispensable role in a wide range of domain-specific applications, from recommender systems to conversational platforms. Textual HINs are graphs with abundant textual information. Currently, most advanced approaches to mine textual features from HINs follow a “pre-training and fine-tuning” schema, which may cause a “negative transfer” problem since there is a gap between pre-training tasks and downstream tasks. We propose a prompt-learning framework P-HIN that provides a new angle to align textual information and graph information, while narrowing down the gap between the pre-trained models and various downstream tasks. To the best of our knowledge, we are among the first to introduce and exploit the idea of prompt learning to align HIN features and textual features. The proposed framework P-HIN is composed of a text encoder and a graph encoder and uses contrastive learning to align and fuse the graph–text pair. This pre-training operation naturally fits the few-shot learning setting. For the graph encoder, we introduce two graph pre-training tasks, masked node modeling and edge reconstruction, to exploit self-supervised information. During optimization, instead of handcrafted prompts, we use a learnable continuous text that enables more efficient and task-relevant transfer to downstream datasets. We consider a residual connection to use the context from the graph to prompt the text encoder. In experiments, P-HIN consistently and significantly outperforms state-of-the-art alternatives on all real-life datasets.
HGMRP extends single-relation prompts into a composite structure that includes both relation-specific and shared components, thereby enhancing expressive capability and significantly out-performs existing heterogeneous prompt methods, validating its effectiveness and superiority.
Feng-Yu Yan, Xiao-Bao Wang, Qian-Xi Tang et al.· Proceedings of the Thirty-Fi...· 0 citations
Heterogeneous Graph Contrastive Recommendation is proposed, a heterogeneous graph contrastive learning framework for cold-start multi-modal recommendation that consistently outperforms representative graph-based and multi-modal recommendation baselines.
Text-Attributed Graphs (TAGs) are prevalent in various real-world scenarios, where each node is associated with a text attribute. Representation learning on TAGs relies on a comprehensive understanding of both the textual attributes and the topological connections. Recent works have enhanced graph neural networks (GNNs...
Hao Yan, Chao-Zhuo Li, Jun Yin et al.· ACM Transactions on Intellig...· 0 citations
Standard information retrieval systems often miss deeper meaning when queries are short, vague, or lack specifics. We
propose a hybrid framework that pulls structured data from Wikidata and combines dense and sparse retrieval methods to
improve both finding documents and generating answers. Our method first identifies...
Abhishek Dwivedi, Shesh Mani Tiwari, Mohd. Shah Alam et al.· International Journal for Re...· 0 citations
This work proposes a TextVQA framework that integrates external prior knowledge to support multimodal reasoning and demonstrates that this approach effectively leverages external knowledge to improve performance on knowledge-intensive questions.
Click-through rate (CTR) prediction is a crucial task to estimate the probability that users will click on items in online platforms. Recently, researchers have incorporated semantics derived from large language models (LLMs) into representations of users and items in graph neural networks (GNNs) framework to facilitat...
Shan Gao, Yan-Wu Yang· ACM Transactions on Knowledg...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.