Aug 2026· ACM Transactions on Knowledge Discovery from Data· 0 citations· 39 references
TL;DR
An LLMs-augmented knowledge graph (LAKG) model for semantic-aware recommendation is proposed, which introduces LLMs to extract semantic features from associated texts to enhance the semantic-aware ability.
Abstract
Knowledge graph (KG) contains rich factual and item-related information, and improves recommendation accuracy and explainability significantly. However, existing KG-based methods mainly focus on utilizing ID-based structural information, which has shown insurmountable performance bottlenecks. Actually, there is also a large amount of textual information in KG. It becomes a great challenge on how to utilize textual information for higher performance. Recently, large language models (LLMs) have been proved to have powerful semantic understanding capabilities and provide a novel approach for enhancing KG. To this end, this paper proposes an LLMs-augmented knowledge graph (LAKG) model for semantic-aware recommendation, which introduces LLMs to extract semantic features from associated texts to enhance the semantic-aware ability. First, semantic features of users and items are extracted from associated texts by the LLMs. Second, high-order structural features, which are modeled with fine-grained user intents, are further extracted from structural information by a graph attention network. Third, the semantic features and structural features are deeply fused to generate high-quality feature representations of users and items. The augmented feature information is great valuable for recommendation systems to predict the purchasing behavior of users. Experimental results show that the proposed model outperforms existing state-of-the-art baseline models, and the average accuracy improves by 4.46% on three public benchmarks.
A novel framework KD-GAG is proposed that efficiently constructs KGs by distilling teacher LLMs' semantics and reasoning into a smaller student LLM and a preference-based subgraph pruning method to optimize the retrieval process.
Long Zhao, Yin Xu, Yan-Yan Wang et al.· Neural Networks· 0 citations
Knowledge graph–based recommendation systems, such as KGCN, have been widely adopted to alleviate data sparsity and cold-start issues by incorporating auxiliary semantic information. However, most existing methods model either the user side or the item side independently, failing to fully exploit the complementary in...
Jing-Yi Hu, Yi-Wen Zhang, Xi-Qin Ao et al.· Scientific Reports· 0 citations
Integrating Knowledge Graphs (KGs) into Retrieval-Augmented Generation (RAG) can substantially improve LLM performance on complex question answering (QA) by reducing hallucinations and supplying structured context. However, building high-quality KGs over large corpora for edge scenarios is challenging: cloud-based proc...
Yuyu Du, Ju-Xin Niu, Chun Jason Xue et al.· IEEE International Conferenc...· 0 citations
GALLM constructs a collaborative graph over text tokens and item tokens, and models three types of relations that are transformed into lightweight learnable attention biases and incorporated into the LLM attention mechanism, enabling collaborative-aware token interactions without introducing an additional graph encoder...
Fenglin Yan, Bo-Hao Wang, Jian Zhang et al.· 0 citations
A knowledge graph completion model based on semantic constrained hybrid scoring (SCHS) is proposed, which integrates three synergistic mechanisms that essentially resolves the rigid trade-off between geometric alignment and flexible semantic matching.
Peng-Song Duan, Jia-Ke Zhao, Bo Zhang et al.· International journal of sof...· 0 citations
KG-aware recommendation has been widely studied to alleviate data sparsity by using knowledge graphs (KGs), which represent items, entities, and their relations as graphs and provide item-side knowledge. However, existing methods incorporate item knowledge without considering how much each user or item node should rely...
Jaehyun Park, Minseo Jeon, Daewon Gwak et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.