版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Auckland Univ Technol 2 Wakefield St Auckland Cbd New Zealand
出 版 物:《KNOWLEDGE-BASED SYSTEMS》 (知识库系统)
年 卷 期:2022年第240卷
页 面:107773-107773页
核心收录:
学科分类:08[工学] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:Projects of International Cooperation and Exchanges NSFC
主 题:Graph autoencoder High-order connectivity Data augmentation Hidden representation
摘 要:Early DNN-based collaborative filtering (CF) approaches have demonstrated their superior performance than traditional CF such as Matrix Factorization. However, such approaches treat each user-item interaction as separate data and thus overlook the intrinsic relationships among data instances. Inspired by the discovery that the autoencoder architecture can force the hidden representation to capture information about the structure of the graph data, in this work, we propose a novel framework called High-order Autoencoder based Collaborative Filtering (HACF) that enhances the classic NeuMF framework with autoencoders for capturing latent high-order connectivity signals in the user-item interaction graph. Specifically, each user-item pair is augmented with higher-order neighbours and input to two sets of autoencoders, one set for the users and the other for the items. All the autoencoders in one set share parameters so increasing the number of autoencoders does not increase the model *** have conducted extensive experiments on four popular public benchmark datasets with different sparsity. The overall comparison results demonstrate the advantages of autoencoder-based methods and show that our framework outperforms some state-of-the-art DNN-based collaborative filtering approaches.(c) 2022 Elsevier B.V. All rights reserved.