La Trobe

The integration of knowledge graph convolution network with denoising autoencoder

Download (4.2 MB)
journal contribution
posted on 2024-08-12, 06:16 authored by Gurinder KaurGurinder Kaur, Fei LiuFei Liu, Yi-Ping Phoebe ChenYi-Ping Phoebe Chen
The knowledge graph convolution network (KGCN) is a recommendation model that provides a set of top recommendations based on knowledge graph developed between users, items, and their attributes. In this study, we integrate the KGCN model with denoising autoencoder (DAE) to improve its recommendation performance. A trained DAE is used to sample K-dimensional latent representation for each user, which then transforms that representation to generate a probability distribution over items. The relationship between acquired latent representation and the meta features is modelled using multivariate multiple regression (MMR) kernel. As a result, without the need for new configuration assessments, performance estimation of new data is pursued directly through MMR and the decoder of DAE. Empirically, we demonstrate that on real-world datasets, the proposed method substantially outperforms other state-of-the-art baselines. Movie-Lens 100K (ML-100K) and Movie-Lens 1M (ML-1M), two common MovieLens datasets, are used to verify the accuracy of the proposed approach. The results from experiments show significant improvement of 41.17% when the proposed method is applied on KGCN model. The proposed framework outperforms other state-of-the-art frameworks on Recall@K and normalized discounted cumulative gain (NDCG@K) metrics by achieving higher scores for Recall@5, Recall@10, NDCG@1, and NDCG@10.

Funding

This work was supported by an Australian Government Research Training Program Scholarship.

History

Publication Date

2024-09-01

Journal

Engineering Applications of Artificial Intelligence

Volume

135

Article Number

108792

Pagination

11p.

Publisher

Elsevier Ltd.

ISSN

0952-1976

Rights Statement

/© 2024 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).