AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Tsinghua Science and Technology Article
PDF (4.3 MB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Attention-Enhanced and Knowledge-Fused Dual Item Representations Network for Recommendation

College of Mathematics and Information Science, Hebei University, Baoding 071002, China
Beijing Institute for Scientific and Engineering Computing, Beijing University of Technology, Beijing 100124, China
Show Author Information

Abstract

Integrating Knowledge Graphs (KGs) into recommendation systems as supplementary information has become a prevalent strategy. By leveraging the semantic relationships between entities in KGs, recommendation systems can better comprehend user preferences. Due to the unique structure of KGs, methods based on Graph Neural Networks (GNNs) have emerged as the current technical trend. However, existing GNN-based methods struggle to (1) filter out noisy information in real-world KGs, and (2) differentiate the item representations obtained from the knowledge graph and bipartite graph. In this paper, we introduce a novel model called Attention-enhanced and Knowledge-fused Dual item representations Network for recommendation (namely AKDN) that employs attention and gated mechanisms to guide aggregation on both knowledge graphs and bipartite graphs. In particular, we firstly design an attention mechanism to determine the weight of each edge in the information aggregation on KGs, which reduces the influence of noisy information on the items and enables us to obtain more accurate and robust representations of the items. Furthermore, we exploit a gated aggregation mechanism to differentiate collaborative signals and knowledge information, and leverage dual item representations to fuse them together for better capturing user behavior patterns. We conduct extensive experiments on two public datasets which demonstrate the superior performance of our AKDN over state-of-the-art methods, like Knowledge Graph Attention Network (KGAT) and Knowledge Graph-based Intent Network (KGIN).

Keywords

Recommender System (RS)Knowledge Graph (KG)Graph Neural Networks (GNN)attention mechanism

References

[1]
J. Chang, C. Gao, Y. Zheng, Y. Hui, Y. Niu, Y. Song, D. Jin, and Y. Li, Sequential recommendation with graph neural networks, in Proc. 44th Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Virtual Event, 2021, pp. 378–387.
Crossref
[2]
Z. Gharibshah and X. Zhu, User response prediction in online advertising, ACM Comput. Surv., vol. 54, no. 3, pp. 1–43, 2022.
Crossref
[3]
S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, BPR: Bayesian personalized ranking from implicit feedback, arXiv preprint arXiv: 1205.2618, 2012.
[4]
X. He, L. Liao, H. Zhang, L. Nie, X. Hu, and T.-S. Chua, Neural collaborative filtering, in Proc. 26th Int. Conf. World Wide Web, Perth, Australia, 2017, pp. 173–182.
Crossref
[5]
J. Lian, X. Zhou, F. Zhang, Z. Chen, X. Xie, and G. Sun, xDeepFM: Combining explicit and implicit feature interactions for recommender systems, in Proc. 24th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, London, UK, 2018, pp. 1754–1763.
Crossref
[6]
H. Wang, F. Zhang, X. Xie, and M. Guo, DKN: Deep knowledge-aware network for news recommendation, in Proc. 2018 World Wide Web Conf., Lyon, France, 2018, pp. 1835−1844.
Crossref
[7]
Q. Ai, V. Azizi, X. Chen, and Y. Zhang, Learning heterogeneous knowledge base embeddings for explainable recommendation, Algorithms, vol. 11, no. 9, p. 137, 2018.
Crossref
[8]
Y. Lin, Z. Liu, M. Sun, Y. Liu, and X. Zhu, Learning entity and relation embeddings for knowledge graph completion, in Proc. Twenty-Ninth AAAI Conf. Artificial Intelligence, Austin, TX, USA, 2015, pp. 2181–2187.
Crossref
[9]
A. Bordes, N. Usunier, A. Garcia-Durán, J. Weston, and O. Yakhnenko, Translating embeddings for modeling multi-relational data, in Proc. 26th Int. Conf. Neural Information Processing Systems - Volume 2, Lake Tahoe, Nevada, 2013, pp. 2787–2795.
[10]
Z. Wang, J. Zhang, J. Feng, and Z. Chen, Knowledge graph embedding by translating on hyperplanes, in Proc. Twenty-Eighth AAAI Conf. Artificial Intelligence, Québec City, Canada, 2014, pp. 1112–1119.
Crossref
[11]
B. Hu, C. Shi, W. X. Zhao, and P. S. Yu, Leveraging meta-path based context for top-N recommendation with a neural co-attention model, in Proc. 24th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, London, UK, 2018, pp. 1531–1540.
Crossref
[12]
J. Jin, J. Qin, Y. Fang, K. Du, W. Zhang, Y. Yu, Z. Zhang, and A. J. Smola, An efficient neighborhood-based interaction model for recommendation on heterogeneous graph, in Proc. 26th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, Virtual Event, 2020, pp. 75–84.
Crossref
[13]
R. Catherine and W. Cohen, Personalized recommendations using knowledge graphs: A probabilistic logic programming approach, in Proc. 10th ACM Conf. Recommender Systems, Boston, MA, USA, 2016, pp. 325–332.
Crossref
[14]
X. Wang, X. He, Y. Cao, M. Liu, and T.-S. Chua, KGAT: Knowledge graph attention network for recommendation, in Proc. 25th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, Anchorage, AK, USA, 2019, pp. 950–958.
Crossref
[15]
X. Wang, T. Huang, D. Wang, Y. Yuan, Z. Liu, X. He, and T.-S. Chua, Learning intents behind interactions with knowledge graph for recommendation, in Proc. Web Conf. 2021, Ljubljana, Slovenia, 2021, pp. 878–887.
Crossref
[16]
H. Wang, M. Zhao, X. Xie, W. Li, and M. Guo, Knowledge graph convolutional networks for recommender systems, in Proc. 2019 World Wide Web Conference, San Francisco, CA, USA, 2019, pp. 3307–3313.
Crossref
[17]
X. Wang, X. He, M. Wang, F. Feng, and T.-S. Chua, Neural graph collaborative filtering, in Proc. 42nd Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Paris, France, 2019, pp. 165–174.
Crossref
[18]
Y. Du, X. Zhu, L. Chen, B. Zheng, and Y. Gao, HAKG: Hierarchy-aware knowledge gated network for recommendation, in Proc. 45th Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Madrid, Spain, 2022, pp. 1390–1400.
Crossref
[19]
D. Zou, W. Wei, Z. Wang, X.-L. Mao, F. Zhu, R. Fang, and D. Chen, Improving knowledge-aware recommendation with multi-level interactive contrastive learning, in Proc. 31st ACM Int. Conf. Information & Knowledge Management, Atlanta, GA, USA, 2022, pp. 2817–2826.
Crossref
[20]
D. Zou, W. Wei, X.-L. Mao, Z. Wang, M. Qiu, F. Zhu, and X. Cao, Multi-level cross-view contrastive learning for knowledge-aware recommender system, in Proc. 45th Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Madrid, Spain, 2022, pp. 1358–1368.
Crossref
[21]
L. Lu, B. Wang, Z. Zhang, S. Liu, and H. Xu, VRKG4Rec: Virtual relational knowledge graph for recommendation, in Proc. Sixteenth ACM Int. Conf. Web Search and Data Mining, Singapore, 2023, pp. 526–534.
Crossref
[22]
Y. Wei, X. Wang, L. Nie, S. Li, D. Wang, and T.-S. Chua, Causal inference for knowledge graph based recommendation, IEEE Trans. Knowl. Data Eng., vol. 35, no. 11, pp. 11153–11164, 2023.
Crossref
[23]
H. Wang, Y. Xu, C. Yang, C. Shi, X. Li, N. Guo, and Z. Liu, Knowledge-adaptive contrastive learning for recommendation, in Proc. Sixteenth ACM Int. Conf. Web Search and Data Mining, Singapore, 2023, pp. 535−543.
Crossref
[24]
Z. Wang, G. Lin, H. Tan, Q. Chen, and X. Liu, CKAN: Collaborative knowledge-aware attentive network for recommender systems, in Proc. 43rd Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Virtual Event, 2020, pp. 219–228.
Crossref
[25]
P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, Graph attention networks, arXiv preprint arXiv: 1710.10903, 2017.
[26]
Y. Yang, C. Huang, L. Xia, and C. Li, Knowledge graph contrastive learning for recommendation, in Proc. 45th Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Madrid, Spain, 2022, pp. 1434–1443.
Crossref
[27]
X. He, K. Deng, X. Wang, Y. Li, Y. Zhang, and M. Wang, LightGCN: Simplifying and powering graph convolution network for recommendation, in Proc. 43rd Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Virtual Event, 2020, pp. 639–648.
Crossref
[28]
C.-Y. Tai, M.-R. Wu, Y.-W. Chu, S.-Y. Chu, and L.-W. Ku, MVIN: Learning multiview items for recommendation, in Proc. 43rd Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Virtual Event, 2020, pp. 99–108.
Crossref
[29]
J. Chung, C. Gulcehre, K. Cho, and Y. Bengio, Empirical evaluation of gated recurrent neural networks on sequence modeling, arXiv preprint arXiv: 1412.3555, 2014.
[30]
Y. Du, X. Zhu, L. Chen, Z. Fang, and Y. Gao, MetaKG: Meta-learning on knowledge graph for cold-start recommendation, IEEE Trans. Knowl. Data Eng., vol. 35, no. 10, pp. 9850–9863, 2023.
Crossref
[31]
Y. Chen, M. Yang, Y. Zhang, M. Zhao, Z. Meng, J. Hao, and I. King, Modeling scale-free graphs with hyperbolic geometry for knowledge-aware recommendation, in Proc. Fifteenth ACM Int. Conf. Web Search and Data Mining, Virtual Event, 2022, pp. 94–102.
Crossref
[32]
W. X. Zhao, G. He, K. Yang, H. Dou, J. Huang, S. Ouyang, and J.-R. Wen, KB4Rec: A dataset for linking knowledge bases with recommender systems, Data Intell., vol. 1, no. 2, pp. 121–136, 2019.
Crossref
[33]
W. Krichene and S. Rendle, On sampled metrics for item recommendation, in Proc. 26th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, Virtual Event 2020, pp. 1748−1757.
Crossref
[34]
F. Zhang, N. J. Yuan, D. Lian, X. Xie, and W.-Y. Ma, Collaborative knowledge base embedding for recommender systems, in Proc. 22nd ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, San Francisco, CA, USA, 2016, pp. 353–362.
Crossref
[35]
H. Wang, F. Zhang, M. Zhang, J. Leskovec, M. Zhao, W. Li, and Z. Wang, Knowledge-aware graph neural networks with label smoothness regularization for recommender systems, in Proc. 25th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, Anchorage, AK, USA, 2019, pp. 968–977.
Crossref
[36]
M. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, Modeling relational data with graph convolutional networks, in Proc. European Sematic Web Conference, ESWC 2018, Heraklion, Greece, 2018, pp. 593–607.
Crossref
[37]
D. P. Kingma and J. Ba, Adam: A method for stochastic optimization, arXiv preprint arXiv: 1412.6980, 2014.
[38]
X. Glorot and Y. Bengio, Understanding the difficulty of training deep feedforward neural networks, in Proc. of the thirteenth int. conf. on artificial intelligence and statistics, Sardinia, Italy, 2010, pp. 249–256.
[39]
Y. Cao, X. Wang, X. He, Z. Hu, and T.-S. Chua, Unifying knowledge graph learning and recommendation: Towards a better understanding of user preferences, in Proc. 2019 The World Wide Web Conference, San Francisco, CA, USA, 2019, pp. 151–161.
Crossref
[40]
X. Zhao, Z. Cheng, L. Zhu, J. Zheng, and X. Li, UGRec: Modeling directed and undirected relations for recommendation, in Proc. 44th Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Virtual Event, 2021, pp. 193−202.
Crossref
[41]
J. Huang, W. X. Zhao, H. Dou, J.-R. Wen, and E. Y. Chang, Improving sequential recommendation with knowledge-enhanced memory networks, in Proc. SIGIR '18 : The 41st Int. ACM SIGIR Conf. Research & Development in Information Retrieval, Ann Arbor, MI, USA, 2018, pp. 505–514.
Crossref
[42]
C. Wang, M. Zhang, W. Ma, Y. Liu, and S. Ma, Make it a chorus: Knowledge- and time-aware item modeling for sequential recommendation, in Proc. 43rd Int. ACM SIGIR Conf. Research and Development in Information Retrieval, Virtual Event, 2020, pp. 109–118.
Crossref
[43]
X. Wang, D. Wang, C. Xu, X. He, Y. Cao, and T.-S. Chua, Explainable reasoning over knowledge graphs for recommendation, Proc. AAAI Conf. Artif. Intell., vol. 33, no. 1, pp. 5329–5336, 2019.
Crossref
[44]
Z. Sun, J. Yang, J. Zhang, A. Bozzon, L.-K. Huang, and C. Xu, Recurrent knowledge graph embedding for effective recommendation, in Proc. 12th ACM Conf. Recommender Systems, Vancouver, Canada, 2018, pp. 297−305.
Crossref
[45]
W. Ma, M. Zhang, Y. Cao, W. Jin, C. Wang, Y. Liu, S. Ma, and X. Ren, Jointly learning explainable rules for recommendation with knowledge graph, in Proc. 2019 The World Wide Web Conference, San Francisco, CA, USA, 2019, pp. 1210–1221.
Crossref
[46]
H. Wang, F. Zhang, J. Wang, M. Zhao, W. Li, X. Xie, and M. Guo, RippleNet: Propagating user preferences on the knowledge graph for recommender systems, in Proc. 27th ACM Int. Conf. Information and Knowledge Management, Torino, Italy, 2018, pp. 417–426.
Crossref
[47]
Y. Lu, Y. Fang, and C. Shi, Meta-learning on heterogeneous information networks for cold-start recommendation, in Proc. 26th ACM SIGKDD Int. Conf. Knowledge Discovery & Data Mining, Virtual Event, 2020, pp. 1563–1573.
Crossref
[48]
W. L. Hamilton, R. Ying, and J. Leskovec, Inductive representation learning on large graphs, in Proc. 31st Int. Conf. Neural Information Processing Systems, Long Beach, CA, USA, 2017, pp. 1025–1035.
[49]
T. N. Kipf and M. Welling, Semi-supervised classification with graph convolutional networks, arXiv preprint arXiv: 1609.02907, 2016.
[50]
F. Wu, T. Zhang, A. H. de Souza Jr., and C. Fifty, T. Yu, and K. Q. Weinberger, Simplifying graph convolutional networks, arXiv preprint arXiv: 1902.07153, 2019.
Tsinghua Science and Technology
Volume 30 Issue 2,
April 2025
Pages 585-599
DOI: 10.26599/TST.2023.9010143
Cite this article:
Hua Q, Zhou J, Zhang F, et al. Attention-Enhanced and Knowledge-Fused Dual Item Representations Network for Recommendation. Tsinghua Science and Technology, 2025, 30(2): 585-599. https://doi.org/10.26599/TST.2023.9010143

71

Views

4

Downloads

0

Crossref

0

Web of Science

0

Scopus

0

CSCD

Altmetrics
Received: 13 August 2023
Revised: 20 October 2023
Accepted: 21 November 2023
Published: 09 December 2024
© The Author(s) 2025.

The articles published in this open access journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).
Return